./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 678e0110
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6b0d7476cc0073434242dc88ffbb328415efe
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
--- Real Ultimate output ---
This is Ultimate 0.1.24-678e011
[2019-11-19 20:51:41,990 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-11-19 20:51:41,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-19 20:51:42,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-19 20:51:42,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-19 20:51:42,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-19 20:51:42,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-19 20:51:42,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-19 20:51:42,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-19 20:51:42,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-19 20:51:42,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-11-19 20:51:42,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-19 20:51:42,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-19 20:51:42,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-19 20:51:42,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-19 20:51:42,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-19 20:51:42,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-19 20:51:42,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-19 20:51:42,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-19 20:51:42,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-19 20:51:42,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-19 20:51:42,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-19 20:51:42,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-11-19 20:51:42,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-19 20:51:42,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-19 20:51:42,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-19 20:51:42,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-19 20:51:42,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-19 20:51:42,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-19 20:51:42,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-19 20:51:42,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-19 20:51:42,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-19 20:51:42,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-19 20:51:42,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-19 20:51:42,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-19 20:51:42,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-19 20:51:42,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-19 20:51:42,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-19 20:51:42,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-19 20:51:42,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-19 20:51:42,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-11-19 20:51:42,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2019-11-19 20:51:42,057 INFO L113 SettingsManager]: Loading preferences was successful
[2019-11-19 20:51:42,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-19 20:51:42,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-19 20:51:42,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-11-19 20:51:42,059 INFO L138 SettingsManager]: * Use SBE=true
[2019-11-19 20:51:42,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-19 20:51:42,060 INFO L138 SettingsManager]: * sizeof long=4
[2019-11-19 20:51:42,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-11-19 20:51:42,060 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-11-19 20:51:42,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-11-19 20:51:42,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-11-19 20:51:42,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-19 20:51:42,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-11-19 20:51:42,061 INFO L138 SettingsManager]: * sizeof long double=12
[2019-11-19 20:51:42,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-11-19 20:51:42,062 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-11-19 20:51:42,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-11-19 20:51:42,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-19 20:51:42,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-11-19 20:51:42,063 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-11-19 20:51:42,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-11-19 20:51:42,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-19 20:51:42,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-19 20:51:42,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-11-19 20:51:42,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-19 20:51:42,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-11-19 20:51:42,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-19 20:51:42,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-19 20:51:42,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bde6b0d7476cc0073434242dc88ffbb328415efe
[2019-11-19 20:51:42,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-19 20:51:42,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-19 20:51:42,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-19 20:51:42,395 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-11-19 20:51:42,395 INFO L275 PluginConnector]: CDTParser initialized
[2019-11-19 20:51:42,396 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c
[2019-11-19 20:51:42,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ef277e/8d9a9bb4c79f4fd8b0651cc2c87ae498/FLAGa0fb700e1
[2019-11-19 20:51:42,934 INFO L306 CDTParser]: Found 1 translation units.
[2019-11-19 20:51:42,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_7.cil.c
[2019-11-19 20:51:42,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ef277e/8d9a9bb4c79f4fd8b0651cc2c87ae498/FLAGa0fb700e1
[2019-11-19 20:51:43,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626ef277e/8d9a9bb4c79f4fd8b0651cc2c87ae498
[2019-11-19 20:51:43,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-19 20:51:43,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2019-11-19 20:51:43,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-19 20:51:43,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-19 20:51:43,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-19 20:51:43,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647e69ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43, skipping insertion in model container
[2019-11-19 20:51:43,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,333 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-11-19 20:51:43,382 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-11-19 20:51:43,642 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 20:51:43,647 INFO L188 MainTranslator]: Completed pre-run
[2019-11-19 20:51:43,767 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 20:51:43,789 INFO L192 MainTranslator]: Completed translation
[2019-11-19 20:51:43,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43 WrapperNode
[2019-11-19 20:51:43,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-19 20:51:43,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-19 20:51:43,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-19 20:51:43,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-19 20:51:43,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-19 20:51:43,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-19 20:51:43,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-19 20:51:43,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-11-19 20:51:43,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-19 20:51:43,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-19 20:51:43,905 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-11-19 20:51:43,911 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-11-19 20:51:43,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-19 20:51:43,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-19 20:51:43,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-19 20:51:44,145 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2019-11-19 20:51:44,772 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false;
[2019-11-19 20:51:44,772 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false;
[2019-11-19 20:51:44,774 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-19 20:51:44,774 INFO L285 CfgBuilder]: Removed 7 assume(true) statements.
[2019-11-19 20:51:44,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:44 BoogieIcfgContainer
[2019-11-19 20:51:44,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-19 20:51:44,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-19 20:51:44,777 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-11-19 20:51:44,781 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-11-19 20:51:44,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:43" (1/3) ...
[2019-11-19 20:51:44,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecd61d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:44, skipping insertion in model container
[2019-11-19 20:51:44,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (2/3) ...
[2019-11-19 20:51:44,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecd61d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:44, skipping insertion in model container
[2019-11-19 20:51:44,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:44" (3/3) ...
[2019-11-19 20:51:44,785 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c
[2019-11-19 20:51:44,794 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-19 20:51:44,802 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-11-19 20:51:44,813 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-11-19 20:51:44,851 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-11-19 20:51:44,852 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-11-19 20:51:44,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-19 20:51:44,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-19 20:51:44,854 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-19 20:51:44,854 INFO L378 AbstractCegarLoop]: Difference is false
[2019-11-19 20:51:44,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-19 20:51:44,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-19 20:51:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states.
[2019-11-19 20:51:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-11-19 20:51:44,886 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:44,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:44,888 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash -356314755, now seen corresponding path program 1 times
[2019-11-19 20:51:44,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:44,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17830633]
[2019-11-19 20:51:44,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:45,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17830633]
[2019-11-19 20:51:45,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:45,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:45,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398980349]
[2019-11-19 20:51:45,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:45,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,137 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states.
[2019-11-19 20:51:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:45,451 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions.
[2019-11-19 20:51:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:45,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32
[2019-11-19 20:51:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:45,476 INFO L225 Difference]: With dead ends: 328
[2019-11-19 20:51:45,477 INFO L226 Difference]: Without dead ends: 170
[2019-11-19 20:51:45,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2019-11-19 20:51:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159.
[2019-11-19 20:51:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states.
[2019-11-19 20:51:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions.
[2019-11-19 20:51:45,531 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 32
[2019-11-19 20:51:45,532 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:45,532 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions.
[2019-11-19 20:51:45,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions.
[2019-11-19 20:51:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2019-11-19 20:51:45,534 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:45,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:45,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:45,535 INFO L82 PathProgramCache]: Analyzing trace with hash 863724593, now seen corresponding path program 1 times
[2019-11-19 20:51:45,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:45,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902969101]
[2019-11-19 20:51:45,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:45,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902969101]
[2019-11-19 20:51:45,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:45,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:45,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985788083]
[2019-11-19 20:51:45,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:45,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,633 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand 3 states.
[2019-11-19 20:51:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:45,883 INFO L93 Difference]: Finished difference Result 350 states and 565 transitions.
[2019-11-19 20:51:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:45,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33
[2019-11-19 20:51:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:45,887 INFO L225 Difference]: With dead ends: 350
[2019-11-19 20:51:45,887 INFO L226 Difference]: Without dead ends: 198
[2019-11-19 20:51:45,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2019-11-19 20:51:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187.
[2019-11-19 20:51:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2019-11-19 20:51:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 305 transitions.
[2019-11-19 20:51:45,927 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 305 transitions. Word has length 33
[2019-11-19 20:51:45,927 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:45,928 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 305 transitions.
[2019-11-19 20:51:45,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 305 transitions.
[2019-11-19 20:51:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2019-11-19 20:51:45,931 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:45,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:45,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131565, now seen corresponding path program 1 times
[2019-11-19 20:51:45,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:45,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071882099]
[2019-11-19 20:51:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:46,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071882099]
[2019-11-19 20:51:46,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253655919]
[2019-11-19 20:51:46,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,066 INFO L87 Difference]: Start difference. First operand 187 states and 305 transitions. Second operand 3 states.
[2019-11-19 20:51:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,309 INFO L93 Difference]: Finished difference Result 411 states and 676 transitions.
[2019-11-19 20:51:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39
[2019-11-19 20:51:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,314 INFO L225 Difference]: With dead ends: 411
[2019-11-19 20:51:46,314 INFO L226 Difference]: Without dead ends: 231
[2019-11-19 20:51:46,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states.
[2019-11-19 20:51:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225.
[2019-11-19 20:51:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states.
[2019-11-19 20:51:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 374 transitions.
[2019-11-19 20:51:46,337 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 374 transitions. Word has length 39
[2019-11-19 20:51:46,337 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,338 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 374 transitions.
[2019-11-19 20:51:46,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 374 transitions.
[2019-11-19 20:51:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2019-11-19 20:51:46,343 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,343 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430900, now seen corresponding path program 1 times
[2019-11-19 20:51:46,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344634148]
[2019-11-19 20:51:46,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:46,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344634148]
[2019-11-19 20:51:46,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943468322]
[2019-11-19 20:51:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,429 INFO L87 Difference]: Start difference. First operand 225 states and 374 transitions. Second operand 3 states.
[2019-11-19 20:51:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,659 INFO L93 Difference]: Finished difference Result 460 states and 766 transitions.
[2019-11-19 20:51:46,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40
[2019-11-19 20:51:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,665 INFO L225 Difference]: With dead ends: 460
[2019-11-19 20:51:46,665 INFO L226 Difference]: Without dead ends: 242
[2019-11-19 20:51:46,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2019-11-19 20:51:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236.
[2019-11-19 20:51:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states.
[2019-11-19 20:51:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 395 transitions.
[2019-11-19 20:51:46,694 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 395 transitions. Word has length 40
[2019-11-19 20:51:46,694 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,695 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 395 transitions.
[2019-11-19 20:51:46,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 395 transitions.
[2019-11-19 20:51:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2019-11-19 20:51:46,697 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,698 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1035045975, now seen corresponding path program 1 times
[2019-11-19 20:51:46,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107251150]
[2019-11-19 20:51:46,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:46,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107251150]
[2019-11-19 20:51:46,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719629485]
[2019-11-19 20:51:46,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,773 INFO L87 Difference]: Start difference. First operand 236 states and 395 transitions. Second operand 3 states.
[2019-11-19 20:51:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,937 INFO L93 Difference]: Finished difference Result 504 states and 848 transitions.
[2019-11-19 20:51:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58
[2019-11-19 20:51:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,940 INFO L225 Difference]: With dead ends: 504
[2019-11-19 20:51:46,940 INFO L226 Difference]: Without dead ends: 275
[2019-11-19 20:51:46,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2019-11-19 20:51:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261.
[2019-11-19 20:51:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states.
[2019-11-19 20:51:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 438 transitions.
[2019-11-19 20:51:46,953 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 438 transitions. Word has length 58
[2019-11-19 20:51:46,954 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,954 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 438 transitions.
[2019-11-19 20:51:46,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 438 transitions.
[2019-11-19 20:51:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2019-11-19 20:51:46,957 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,957 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash 629766653, now seen corresponding path program 1 times
[2019-11-19 20:51:46,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732989483]
[2019-11-19 20:51:46,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:47,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732989483]
[2019-11-19 20:51:47,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415987052]
[2019-11-19 20:51:47,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,019 INFO L87 Difference]: Start difference. First operand 261 states and 438 transitions. Second operand 3 states.
[2019-11-19 20:51:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,167 INFO L93 Difference]: Finished difference Result 529 states and 888 transitions.
[2019-11-19 20:51:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59
[2019-11-19 20:51:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,170 INFO L225 Difference]: With dead ends: 529
[2019-11-19 20:51:47,170 INFO L226 Difference]: Without dead ends: 275
[2019-11-19 20:51:47,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2019-11-19 20:51:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261.
[2019-11-19 20:51:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states.
[2019-11-19 20:51:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 435 transitions.
[2019-11-19 20:51:47,185 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 435 transitions. Word has length 59
[2019-11-19 20:51:47,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,187 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 435 transitions.
[2019-11-19 20:51:47,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 435 transitions.
[2019-11-19 20:51:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2019-11-19 20:51:47,190 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,194 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash -525858366, now seen corresponding path program 1 times
[2019-11-19 20:51:47,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900934980]
[2019-11-19 20:51:47,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:47,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900934980]
[2019-11-19 20:51:47,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040463378]
[2019-11-19 20:51:47,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,299 INFO L87 Difference]: Start difference. First operand 261 states and 435 transitions. Second operand 3 states.
[2019-11-19 20:51:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,448 INFO L93 Difference]: Finished difference Result 546 states and 913 transitions.
[2019-11-19 20:51:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60
[2019-11-19 20:51:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,451 INFO L225 Difference]: With dead ends: 546
[2019-11-19 20:51:47,451 INFO L226 Difference]: Without dead ends: 292
[2019-11-19 20:51:47,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states.
[2019-11-19 20:51:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292.
[2019-11-19 20:51:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states.
[2019-11-19 20:51:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 487 transitions.
[2019-11-19 20:51:47,464 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 487 transitions. Word has length 60
[2019-11-19 20:51:47,464 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,465 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 487 transitions.
[2019-11-19 20:51:47,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 487 transitions.
[2019-11-19 20:51:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2019-11-19 20:51:47,467 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,467 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,468 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1083403756, now seen corresponding path program 1 times
[2019-11-19 20:51:47,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314128683]
[2019-11-19 20:51:47,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2019-11-19 20:51:47,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314128683]
[2019-11-19 20:51:47,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763086446]
[2019-11-19 20:51:47,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,531 INFO L87 Difference]: Start difference. First operand 292 states and 487 transitions. Second operand 3 states.
[2019-11-19 20:51:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,647 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions.
[2019-11-19 20:51:47,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72
[2019-11-19 20:51:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,651 INFO L225 Difference]: With dead ends: 594
[2019-11-19 20:51:47,651 INFO L226 Difference]: Without dead ends: 309
[2019-11-19 20:51:47,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2019-11-19 20:51:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307.
[2019-11-19 20:51:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states.
[2019-11-19 20:51:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 508 transitions.
[2019-11-19 20:51:47,667 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 508 transitions. Word has length 72
[2019-11-19 20:51:47,668 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,668 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 508 transitions.
[2019-11-19 20:51:47,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 508 transitions.
[2019-11-19 20:51:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2019-11-19 20:51:47,671 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,671 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,671 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1891971647, now seen corresponding path program 1 times
[2019-11-19 20:51:47,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512605787]
[2019-11-19 20:51:47,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:47,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512605787]
[2019-11-19 20:51:47,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990953949]
[2019-11-19 20:51:47,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,740 INFO L87 Difference]: Start difference. First operand 307 states and 508 transitions. Second operand 3 states.
[2019-11-19 20:51:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,926 INFO L93 Difference]: Finished difference Result 645 states and 1069 transitions.
[2019-11-19 20:51:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72
[2019-11-19 20:51:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,929 INFO L225 Difference]: With dead ends: 645
[2019-11-19 20:51:47,929 INFO L226 Difference]: Without dead ends: 345
[2019-11-19 20:51:47,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states.
[2019-11-19 20:51:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343.
[2019-11-19 20:51:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states.
[2019-11-19 20:51:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 568 transitions.
[2019-11-19 20:51:47,945 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 568 transitions. Word has length 72
[2019-11-19 20:51:47,946 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,946 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 568 transitions.
[2019-11-19 20:51:47,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 568 transitions.
[2019-11-19 20:51:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2019-11-19 20:51:47,948 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,948 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1471078304, now seen corresponding path program 1 times
[2019-11-19 20:51:47,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13246986]
[2019-11-19 20:51:47,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2019-11-19 20:51:47,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13246986]
[2019-11-19 20:51:47,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261117616]
[2019-11-19 20:51:47,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,998 INFO L87 Difference]: Start difference. First operand 343 states and 568 transitions. Second operand 3 states.
[2019-11-19 20:51:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,122 INFO L93 Difference]: Finished difference Result 681 states and 1127 transitions.
[2019-11-19 20:51:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73
[2019-11-19 20:51:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,124 INFO L225 Difference]: With dead ends: 681
[2019-11-19 20:51:48,125 INFO L226 Difference]: Without dead ends: 345
[2019-11-19 20:51:48,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states.
[2019-11-19 20:51:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343.
[2019-11-19 20:51:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states.
[2019-11-19 20:51:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 562 transitions.
[2019-11-19 20:51:48,141 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 562 transitions. Word has length 73
[2019-11-19 20:51:48,142 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,142 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 562 transitions.
[2019-11-19 20:51:48,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 562 transitions.
[2019-11-19 20:51:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2019-11-19 20:51:48,143 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,144 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,144 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1412542918, now seen corresponding path program 1 times
[2019-11-19 20:51:48,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319946314]
[2019-11-19 20:51:48,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:48,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319946314]
[2019-11-19 20:51:48,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092570440]
[2019-11-19 20:51:48,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,195 INFO L87 Difference]: Start difference. First operand 343 states and 562 transitions. Second operand 3 states.
[2019-11-19 20:51:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,345 INFO L93 Difference]: Finished difference Result 681 states and 1115 transitions.
[2019-11-19 20:51:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73
[2019-11-19 20:51:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,348 INFO L225 Difference]: With dead ends: 681
[2019-11-19 20:51:48,348 INFO L226 Difference]: Without dead ends: 345
[2019-11-19 20:51:48,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states.
[2019-11-19 20:51:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343.
[2019-11-19 20:51:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states.
[2019-11-19 20:51:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions.
[2019-11-19 20:51:48,361 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 73
[2019-11-19 20:51:48,362 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,362 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions.
[2019-11-19 20:51:48,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions.
[2019-11-19 20:51:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2019-11-19 20:51:48,363 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,364 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,364 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 842422756, now seen corresponding path program 1 times
[2019-11-19 20:51:48,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809950191]
[2019-11-19 20:51:48,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2019-11-19 20:51:48,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809950191]
[2019-11-19 20:51:48,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746137393]
[2019-11-19 20:51:48,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,407 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand 3 states.
[2019-11-19 20:51:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,568 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions.
[2019-11-19 20:51:48,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79
[2019-11-19 20:51:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,572 INFO L225 Difference]: With dead ends: 708
[2019-11-19 20:51:48,573 INFO L226 Difference]: Without dead ends: 372
[2019-11-19 20:51:48,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2019-11-19 20:51:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367.
[2019-11-19 20:51:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states.
[2019-11-19 20:51:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 595 transitions.
[2019-11-19 20:51:48,593 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 595 transitions. Word has length 79
[2019-11-19 20:51:48,593 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,594 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 595 transitions.
[2019-11-19 20:51:48,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 595 transitions.
[2019-11-19 20:51:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2019-11-19 20:51:48,596 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,597 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,597 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2073472880, now seen corresponding path program 1 times
[2019-11-19 20:51:48,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63709747]
[2019-11-19 20:51:48,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2019-11-19 20:51:48,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63709747]
[2019-11-19 20:51:48,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769893039]
[2019-11-19 20:51:48,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,673 INFO L87 Difference]: Start difference. First operand 367 states and 595 transitions. Second operand 3 states.
[2019-11-19 20:51:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,853 INFO L93 Difference]: Finished difference Result 732 states and 1186 transitions.
[2019-11-19 20:51:48,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80
[2019-11-19 20:51:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,857 INFO L225 Difference]: With dead ends: 732
[2019-11-19 20:51:48,857 INFO L226 Difference]: Without dead ends: 372
[2019-11-19 20:51:48,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2019-11-19 20:51:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367.
[2019-11-19 20:51:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states.
[2019-11-19 20:51:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 589 transitions.
[2019-11-19 20:51:48,879 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 589 transitions. Word has length 80
[2019-11-19 20:51:48,879 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,880 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 589 transitions.
[2019-11-19 20:51:48,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 589 transitions.
[2019-11-19 20:51:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2019-11-19 20:51:48,882 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,883 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,883 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 269550751, now seen corresponding path program 1 times
[2019-11-19 20:51:48,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824747429]
[2019-11-19 20:51:48,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2019-11-19 20:51:48,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824747429]
[2019-11-19 20:51:48,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535562372]
[2019-11-19 20:51:48,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,933 INFO L87 Difference]: Start difference. First operand 367 states and 589 transitions. Second operand 3 states.
[2019-11-19 20:51:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:49,072 INFO L93 Difference]: Finished difference Result 736 states and 1179 transitions.
[2019-11-19 20:51:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:49,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85
[2019-11-19 20:51:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:49,076 INFO L225 Difference]: With dead ends: 736
[2019-11-19 20:51:49,076 INFO L226 Difference]: Without dead ends: 376
[2019-11-19 20:51:49,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states.
[2019-11-19 20:51:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376.
[2019-11-19 20:51:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states.
[2019-11-19 20:51:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions.
[2019-11-19 20:51:49,094 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 85
[2019-11-19 20:51:49,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:49,095 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions.
[2019-11-19 20:51:49,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions.
[2019-11-19 20:51:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2019-11-19 20:51:49,097 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:49,097 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:49,097 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1732524919, now seen corresponding path program 1 times
[2019-11-19 20:51:49,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:49,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276582609]
[2019-11-19 20:51:49,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2019-11-19 20:51:49,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276582609]
[2019-11-19 20:51:49,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:49,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:49,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480485812]
[2019-11-19 20:51:49,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:49,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,142 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand 3 states.
[2019-11-19 20:51:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:49,292 INFO L93 Difference]: Finished difference Result 776 states and 1220 transitions.
[2019-11-19 20:51:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:49,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86
[2019-11-19 20:51:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:49,295 INFO L225 Difference]: With dead ends: 776
[2019-11-19 20:51:49,296 INFO L226 Difference]: Without dead ends: 407
[2019-11-19 20:51:49,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states.
[2019-11-19 20:51:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405.
[2019-11-19 20:51:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states.
[2019-11-19 20:51:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 633 transitions.
[2019-11-19 20:51:49,317 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 633 transitions. Word has length 86
[2019-11-19 20:51:49,317 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:49,317 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 633 transitions.
[2019-11-19 20:51:49,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 633 transitions.
[2019-11-19 20:51:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2019-11-19 20:51:49,319 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:49,320 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:49,320 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash -59923555, now seen corresponding path program 1 times
[2019-11-19 20:51:49,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:49,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78394960]
[2019-11-19 20:51:49,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2019-11-19 20:51:49,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78394960]
[2019-11-19 20:51:49,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:49,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:49,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620678262]
[2019-11-19 20:51:49,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:49,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:49,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,375 INFO L87 Difference]: Start difference. First operand 405 states and 633 transitions. Second operand 3 states.
[2019-11-19 20:51:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:49,505 INFO L93 Difference]: Finished difference Result 805 states and 1257 transitions.
[2019-11-19 20:51:49,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:49,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87
[2019-11-19 20:51:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:49,508 INFO L225 Difference]: With dead ends: 805
[2019-11-19 20:51:49,509 INFO L226 Difference]: Without dead ends: 407
[2019-11-19 20:51:49,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states.
[2019-11-19 20:51:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405.
[2019-11-19 20:51:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states.
[2019-11-19 20:51:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 629 transitions.
[2019-11-19 20:51:49,524 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 629 transitions. Word has length 87
[2019-11-19 20:51:49,524 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:49,524 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 629 transitions.
[2019-11-19 20:51:49,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 629 transitions.
[2019-11-19 20:51:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2019-11-19 20:51:49,526 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:49,527 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:49,527 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1911070133, now seen corresponding path program 1 times
[2019-11-19 20:51:49,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:49,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899686085]
[2019-11-19 20:51:49,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2019-11-19 20:51:49,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899686085]
[2019-11-19 20:51:49,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:49,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:49,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295058791]
[2019-11-19 20:51:49,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:49,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:49,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:49,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,559 INFO L87 Difference]: Start difference. First operand 405 states and 629 transitions. Second operand 3 states.
[2019-11-19 20:51:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:49,700 INFO L93 Difference]: Finished difference Result 828 states and 1288 transitions.
[2019-11-19 20:51:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:49,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100
[2019-11-19 20:51:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:49,704 INFO L225 Difference]: With dead ends: 828
[2019-11-19 20:51:49,704 INFO L226 Difference]: Without dead ends: 430
[2019-11-19 20:51:49,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2019-11-19 20:51:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426.
[2019-11-19 20:51:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states.
[2019-11-19 20:51:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 656 transitions.
[2019-11-19 20:51:49,725 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 656 transitions. Word has length 100
[2019-11-19 20:51:49,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:49,726 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 656 transitions.
[2019-11-19 20:51:49,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 656 transitions.
[2019-11-19 20:51:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2019-11-19 20:51:49,729 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:49,729 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:49,730 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash 75615305, now seen corresponding path program 1 times
[2019-11-19 20:51:49,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:49,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630217280]
[2019-11-19 20:51:49,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2019-11-19 20:51:49,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630217280]
[2019-11-19 20:51:49,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:49,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:49,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397803310]
[2019-11-19 20:51:49,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:49,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,773 INFO L87 Difference]: Start difference. First operand 426 states and 656 transitions. Second operand 3 states.
[2019-11-19 20:51:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:49,907 INFO L93 Difference]: Finished difference Result 849 states and 1307 transitions.
[2019-11-19 20:51:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:49,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101
[2019-11-19 20:51:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:49,910 INFO L225 Difference]: With dead ends: 849
[2019-11-19 20:51:49,911 INFO L226 Difference]: Without dead ends: 430
[2019-11-19 20:51:49,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2019-11-19 20:51:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426.
[2019-11-19 20:51:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states.
[2019-11-19 20:51:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 648 transitions.
[2019-11-19 20:51:49,928 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 648 transitions. Word has length 101
[2019-11-19 20:51:49,928 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:49,928 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 648 transitions.
[2019-11-19 20:51:49,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 648 transitions.
[2019-11-19 20:51:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2019-11-19 20:51:49,930 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:49,930 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:49,931 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1557354836, now seen corresponding path program 1 times
[2019-11-19 20:51:49,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:49,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830429935]
[2019-11-19 20:51:49,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2019-11-19 20:51:49,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830429935]
[2019-11-19 20:51:49,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:49,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:49,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427390260]
[2019-11-19 20:51:49,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:49,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:49,983 INFO L87 Difference]: Start difference. First operand 426 states and 648 transitions. Second operand 3 states.
[2019-11-19 20:51:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:50,132 INFO L93 Difference]: Finished difference Result 890 states and 1351 transitions.
[2019-11-19 20:51:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:50,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102
[2019-11-19 20:51:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:50,136 INFO L225 Difference]: With dead ends: 890
[2019-11-19 20:51:50,136 INFO L226 Difference]: Without dead ends: 471
[2019-11-19 20:51:50,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states.
[2019-11-19 20:51:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468.
[2019-11-19 20:51:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states.
[2019-11-19 20:51:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 709 transitions.
[2019-11-19 20:51:50,153 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 709 transitions. Word has length 102
[2019-11-19 20:51:50,154 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:50,154 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 709 transitions.
[2019-11-19 20:51:50,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 709 transitions.
[2019-11-19 20:51:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2019-11-19 20:51:50,156 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:50,156 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:50,156 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2007457582, now seen corresponding path program 1 times
[2019-11-19 20:51:50,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:50,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885217457]
[2019-11-19 20:51:50,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2019-11-19 20:51:50,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885217457]
[2019-11-19 20:51:50,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:50,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:50,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010719491]
[2019-11-19 20:51:50,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:50,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,201 INFO L87 Difference]: Start difference. First operand 468 states and 709 transitions. Second operand 3 states.
[2019-11-19 20:51:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:50,338 INFO L93 Difference]: Finished difference Result 965 states and 1459 transitions.
[2019-11-19 20:51:50,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:50,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103
[2019-11-19 20:51:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:50,342 INFO L225 Difference]: With dead ends: 965
[2019-11-19 20:51:50,342 INFO L226 Difference]: Without dead ends: 504
[2019-11-19 20:51:50,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states.
[2019-11-19 20:51:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502.
[2019-11-19 20:51:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states.
[2019-11-19 20:51:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 755 transitions.
[2019-11-19 20:51:50,366 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 755 transitions. Word has length 103
[2019-11-19 20:51:50,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:50,366 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 755 transitions.
[2019-11-19 20:51:50,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 755 transitions.
[2019-11-19 20:51:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2019-11-19 20:51:50,368 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:50,368 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:50,369 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash -426212883, now seen corresponding path program 1 times
[2019-11-19 20:51:50,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:50,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628892346]
[2019-11-19 20:51:50,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2019-11-19 20:51:50,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628892346]
[2019-11-19 20:51:50,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:50,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:50,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209600447]
[2019-11-19 20:51:50,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:50,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:50,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,403 INFO L87 Difference]: Start difference. First operand 502 states and 755 transitions. Second operand 3 states.
[2019-11-19 20:51:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:50,546 INFO L93 Difference]: Finished difference Result 1004 states and 1510 transitions.
[2019-11-19 20:51:50,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:50,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103
[2019-11-19 20:51:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:50,549 INFO L225 Difference]: With dead ends: 1004
[2019-11-19 20:51:50,549 INFO L226 Difference]: Without dead ends: 507
[2019-11-19 20:51:50,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states.
[2019-11-19 20:51:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504.
[2019-11-19 20:51:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states.
[2019-11-19 20:51:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 758 transitions.
[2019-11-19 20:51:50,568 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 758 transitions. Word has length 103
[2019-11-19 20:51:50,568 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:50,568 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 758 transitions.
[2019-11-19 20:51:50,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 758 transitions.
[2019-11-19 20:51:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2019-11-19 20:51:50,570 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:50,570 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:50,571 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1947800103, now seen corresponding path program 1 times
[2019-11-19 20:51:50,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:50,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579314244]
[2019-11-19 20:51:50,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2019-11-19 20:51:50,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579314244]
[2019-11-19 20:51:50,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:50,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:50,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294286372]
[2019-11-19 20:51:50,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:50,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,612 INFO L87 Difference]: Start difference. First operand 504 states and 758 transitions. Second operand 3 states.
[2019-11-19 20:51:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:50,760 INFO L93 Difference]: Finished difference Result 1003 states and 1507 transitions.
[2019-11-19 20:51:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:50,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104
[2019-11-19 20:51:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:50,765 INFO L225 Difference]: With dead ends: 1003
[2019-11-19 20:51:50,765 INFO L226 Difference]: Without dead ends: 506
[2019-11-19 20:51:50,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states.
[2019-11-19 20:51:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504.
[2019-11-19 20:51:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states.
[2019-11-19 20:51:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 754 transitions.
[2019-11-19 20:51:50,784 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 754 transitions. Word has length 104
[2019-11-19 20:51:50,784 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:50,785 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 754 transitions.
[2019-11-19 20:51:50,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 754 transitions.
[2019-11-19 20:51:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2019-11-19 20:51:50,786 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:50,787 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:50,787 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:50,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2026242603, now seen corresponding path program 1 times
[2019-11-19 20:51:50,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:50,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597530921]
[2019-11-19 20:51:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked.
[2019-11-19 20:51:50,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597530921]
[2019-11-19 20:51:50,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:50,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:50,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263855245]
[2019-11-19 20:51:50,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:50,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,841 INFO L87 Difference]: Start difference. First operand 504 states and 754 transitions. Second operand 3 states.
[2019-11-19 20:51:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:50,890 INFO L93 Difference]: Finished difference Result 1491 states and 2227 transitions.
[2019-11-19 20:51:50,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:50,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116
[2019-11-19 20:51:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:50,896 INFO L225 Difference]: With dead ends: 1491
[2019-11-19 20:51:50,897 INFO L226 Difference]: Without dead ends: 994
[2019-11-19 20:51:50,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states.
[2019-11-19 20:51:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 505.
[2019-11-19 20:51:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states.
[2019-11-19 20:51:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 755 transitions.
[2019-11-19 20:51:50,934 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 755 transitions. Word has length 116
[2019-11-19 20:51:50,934 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:50,935 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 755 transitions.
[2019-11-19 20:51:50,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 755 transitions.
[2019-11-19 20:51:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2019-11-19 20:51:50,937 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:50,937 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:50,937 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:50,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:50,939 INFO L82 PathProgramCache]: Analyzing trace with hash 24741395, now seen corresponding path program 1 times
[2019-11-19 20:51:50,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:50,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824420761]
[2019-11-19 20:51:50,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2019-11-19 20:51:51,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824420761]
[2019-11-19 20:51:51,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:51,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:51,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356594488]
[2019-11-19 20:51:51,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:51,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,020 INFO L87 Difference]: Start difference. First operand 505 states and 755 transitions. Second operand 3 states.
[2019-11-19 20:51:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:51,107 INFO L93 Difference]: Finished difference Result 1499 states and 2242 transitions.
[2019-11-19 20:51:51,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:51,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116
[2019-11-19 20:51:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:51,112 INFO L225 Difference]: With dead ends: 1499
[2019-11-19 20:51:51,112 INFO L226 Difference]: Without dead ends: 1001
[2019-11-19 20:51:51,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states.
[2019-11-19 20:51:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001.
[2019-11-19 20:51:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states.
[2019-11-19 20:51:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1492 transitions.
[2019-11-19 20:51:51,147 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1492 transitions. Word has length 116
[2019-11-19 20:51:51,147 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:51,148 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1492 transitions.
[2019-11-19 20:51:51,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1492 transitions.
[2019-11-19 20:51:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2019-11-19 20:51:51,150 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:51,151 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:51,151 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1829844413, now seen corresponding path program 1 times
[2019-11-19 20:51:51,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:51,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600321164]
[2019-11-19 20:51:51,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2019-11-19 20:51:51,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600321164]
[2019-11-19 20:51:51,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:51,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:51,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197165182]
[2019-11-19 20:51:51,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:51,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:51,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,202 INFO L87 Difference]: Start difference. First operand 1001 states and 1492 transitions. Second operand 3 states.
[2019-11-19 20:51:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:51,309 INFO L93 Difference]: Finished difference Result 2493 states and 3717 transitions.
[2019-11-19 20:51:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:51,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118
[2019-11-19 20:51:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:51,316 INFO L225 Difference]: With dead ends: 2493
[2019-11-19 20:51:51,316 INFO L226 Difference]: Without dead ends: 1499
[2019-11-19 20:51:51,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states.
[2019-11-19 20:51:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1497.
[2019-11-19 20:51:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states.
[2019-11-19 20:51:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2233 transitions.
[2019-11-19 20:51:51,370 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2233 transitions. Word has length 118
[2019-11-19 20:51:51,370 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:51,371 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2233 transitions.
[2019-11-19 20:51:51,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2233 transitions.
[2019-11-19 20:51:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2019-11-19 20:51:51,374 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:51,374 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:51,374 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:51,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1992320337, now seen corresponding path program 1 times
[2019-11-19 20:51:51,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:51,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902360609]
[2019-11-19 20:51:51,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked.
[2019-11-19 20:51:51,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902360609]
[2019-11-19 20:51:51,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:51,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:51,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292411055]
[2019-11-19 20:51:51,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:51,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,425 INFO L87 Difference]: Start difference. First operand 1497 states and 2233 transitions. Second operand 3 states.
[2019-11-19 20:51:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:51,553 INFO L93 Difference]: Finished difference Result 1997 states and 2978 transitions.
[2019-11-19 20:51:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:51,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119
[2019-11-19 20:51:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:51,563 INFO L225 Difference]: With dead ends: 1997
[2019-11-19 20:51:51,563 INFO L226 Difference]: Without dead ends: 1995
[2019-11-19 20:51:51,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states.
[2019-11-19 20:51:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993.
[2019-11-19 20:51:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states.
[2019-11-19 20:51:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2975 transitions.
[2019-11-19 20:51:51,632 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2975 transitions. Word has length 119
[2019-11-19 20:51:51,632 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:51,632 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 2975 transitions.
[2019-11-19 20:51:51,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2975 transitions.
[2019-11-19 20:51:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2019-11-19 20:51:51,636 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:51,637 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:51,637 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash -364234556, now seen corresponding path program 1 times
[2019-11-19 20:51:51,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:51,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389392223]
[2019-11-19 20:51:51,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2019-11-19 20:51:51,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389392223]
[2019-11-19 20:51:51,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:51,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:51,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595671353]
[2019-11-19 20:51:51,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:51,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,683 INFO L87 Difference]: Start difference. First operand 1993 states and 2975 transitions. Second operand 3 states.
[2019-11-19 20:51:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:51,883 INFO L93 Difference]: Finished difference Result 4167 states and 6200 transitions.
[2019-11-19 20:51:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:51,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149
[2019-11-19 20:51:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:51,893 INFO L225 Difference]: With dead ends: 4167
[2019-11-19 20:51:51,894 INFO L226 Difference]: Without dead ends: 2181
[2019-11-19 20:51:51,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states.
[2019-11-19 20:51:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2157.
[2019-11-19 20:51:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states.
[2019-11-19 20:51:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3195 transitions.
[2019-11-19 20:51:51,971 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3195 transitions. Word has length 149
[2019-11-19 20:51:51,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:51,971 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 3195 transitions.
[2019-11-19 20:51:51,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3195 transitions.
[2019-11-19 20:51:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2019-11-19 20:51:51,975 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:51,976 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:51,976 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1201845333, now seen corresponding path program 1 times
[2019-11-19 20:51:51,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:51,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734403200]
[2019-11-19 20:51:51,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2019-11-19 20:51:52,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734403200]
[2019-11-19 20:51:52,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:52,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:52,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496531671]
[2019-11-19 20:51:52,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:52,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:52,026 INFO L87 Difference]: Start difference. First operand 2157 states and 3195 transitions. Second operand 3 states.
[2019-11-19 20:51:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:52,218 INFO L93 Difference]: Finished difference Result 4331 states and 6412 transitions.
[2019-11-19 20:51:52,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:52,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150
[2019-11-19 20:51:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:52,228 INFO L225 Difference]: With dead ends: 4331
[2019-11-19 20:51:52,229 INFO L226 Difference]: Without dead ends: 2149
[2019-11-19 20:51:52,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states.
[2019-11-19 20:51:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2125.
[2019-11-19 20:51:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states.
[2019-11-19 20:51:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3139 transitions.
[2019-11-19 20:51:52,316 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3139 transitions. Word has length 150
[2019-11-19 20:51:52,316 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:52,316 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 3139 transitions.
[2019-11-19 20:51:52,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3139 transitions.
[2019-11-19 20:51:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2019-11-19 20:51:52,323 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:52,323 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:52,324 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1088692113, now seen corresponding path program 1 times
[2019-11-19 20:51:52,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:52,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647578845]
[2019-11-19 20:51:52,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked.
[2019-11-19 20:51:52,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647578845]
[2019-11-19 20:51:52,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815797207]
[2019-11-19 20:51:52,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:52,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core
[2019-11-19 20:51:52,662 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked.
[2019-11-19 20:51:52,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-19 20:51:52,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-19 20:51:52,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949297014]
[2019-11-19 20:51:52,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:52,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:52,741 INFO L87 Difference]: Start difference. First operand 2125 states and 3139 transitions. Second operand 3 states.
[2019-11-19 20:51:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:52,868 INFO L93 Difference]: Finished difference Result 4774 states and 7050 transitions.
[2019-11-19 20:51:52,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:52,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182
[2019-11-19 20:51:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:52,880 INFO L225 Difference]: With dead ends: 4774
[2019-11-19 20:51:52,880 INFO L226 Difference]: Without dead ends: 2656
[2019-11-19 20:51:52,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states.
[2019-11-19 20:51:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654.
[2019-11-19 20:51:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states.
[2019-11-19 20:51:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3900 transitions.
[2019-11-19 20:51:53,006 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3900 transitions. Word has length 182
[2019-11-19 20:51:53,007 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:53,007 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 3900 transitions.
[2019-11-19 20:51:53,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3900 transitions.
[2019-11-19 20:51:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2019-11-19 20:51:53,015 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:53,015 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:53,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:53,220 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1478070071, now seen corresponding path program 1 times
[2019-11-19 20:51:53,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:53,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740082554]
[2019-11-19 20:51:53,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2019-11-19 20:51:53,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740082554]
[2019-11-19 20:51:53,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:53,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:53,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836201792]
[2019-11-19 20:51:53,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:53,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:53,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:53,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:53,300 INFO L87 Difference]: Start difference. First operand 2654 states and 3900 transitions. Second operand 3 states.
[2019-11-19 20:51:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:53,425 INFO L93 Difference]: Finished difference Result 4243 states and 6236 transitions.
[2019-11-19 20:51:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:53,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186
[2019-11-19 20:51:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:53,440 INFO L225 Difference]: With dead ends: 4243
[2019-11-19 20:51:53,440 INFO L226 Difference]: Without dead ends: 3183
[2019-11-19 20:51:53,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states.
[2019-11-19 20:51:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183.
[2019-11-19 20:51:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states.
[2019-11-19 20:51:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4680 transitions.
[2019-11-19 20:51:53,557 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4680 transitions. Word has length 186
[2019-11-19 20:51:53,557 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:53,557 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4680 transitions.
[2019-11-19 20:51:53,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4680 transitions.
[2019-11-19 20:51:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265
[2019-11-19 20:51:53,566 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:53,567 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:53,567 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash -88686584, now seen corresponding path program 1 times
[2019-11-19 20:51:53,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:53,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370227254]
[2019-11-19 20:51:53,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked.
[2019-11-19 20:51:53,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370227254]
[2019-11-19 20:51:53,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:53,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:53,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225234462]
[2019-11-19 20:51:53,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:53,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:53,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:53,652 INFO L87 Difference]: Start difference. First operand 3183 states and 4680 transitions. Second operand 3 states.
[2019-11-19 20:51:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:53,882 INFO L93 Difference]: Finished difference Result 6419 states and 9421 transitions.
[2019-11-19 20:51:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:53,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264
[2019-11-19 20:51:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:53,899 INFO L225 Difference]: With dead ends: 6419
[2019-11-19 20:51:53,899 INFO L226 Difference]: Without dead ends: 3243
[2019-11-19 20:51:53,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states.
[2019-11-19 20:51:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3183.
[2019-11-19 20:51:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states.
[2019-11-19 20:51:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4632 transitions.
[2019-11-19 20:51:54,113 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4632 transitions. Word has length 264
[2019-11-19 20:51:54,113 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:54,114 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4632 transitions.
[2019-11-19 20:51:54,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4632 transitions.
[2019-11-19 20:51:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269
[2019-11-19 20:51:54,125 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:54,125 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:54,126 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash -304543522, now seen corresponding path program 1 times
[2019-11-19 20:51:54,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:54,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970687609]
[2019-11-19 20:51:54,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2019-11-19 20:51:54,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970687609]
[2019-11-19 20:51:54,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:54,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:54,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972111626]
[2019-11-19 20:51:54,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:54,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:54,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:54,325 INFO L87 Difference]: Start difference. First operand 3183 states and 4632 transitions. Second operand 3 states.
[2019-11-19 20:51:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:54,667 INFO L93 Difference]: Finished difference Result 6455 states and 9367 transitions.
[2019-11-19 20:51:54,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:54,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268
[2019-11-19 20:51:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:54,696 INFO L225 Difference]: With dead ends: 6455
[2019-11-19 20:51:54,698 INFO L226 Difference]: Without dead ends: 3279
[2019-11-19 20:51:54,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states.
[2019-11-19 20:51:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3183.
[2019-11-19 20:51:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states.
[2019-11-19 20:51:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4416 transitions.
[2019-11-19 20:51:54,902 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4416 transitions. Word has length 268
[2019-11-19 20:51:54,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:54,903 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4416 transitions.
[2019-11-19 20:51:54,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4416 transitions.
[2019-11-19 20:51:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279
[2019-11-19 20:51:54,918 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:54,919 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:54,919 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:54,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash -854799102, now seen corresponding path program 1 times
[2019-11-19 20:51:54,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:54,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969092760]
[2019-11-19 20:51:54,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked.
[2019-11-19 20:51:55,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969092760]
[2019-11-19 20:51:55,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:55,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:55,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097765678]
[2019-11-19 20:51:55,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:55,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:55,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:55,100 INFO L87 Difference]: Start difference. First operand 3183 states and 4416 transitions. Second operand 3 states.
[2019-11-19 20:51:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:55,462 INFO L93 Difference]: Finished difference Result 6437 states and 8913 transitions.
[2019-11-19 20:51:55,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:55,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278
[2019-11-19 20:51:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:55,473 INFO L225 Difference]: With dead ends: 6437
[2019-11-19 20:51:55,474 INFO L226 Difference]: Without dead ends: 3261
[2019-11-19 20:51:55,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states.
[2019-11-19 20:51:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3183.
[2019-11-19 20:51:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states.
[2019-11-19 20:51:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4260 transitions.
[2019-11-19 20:51:55,655 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4260 transitions. Word has length 278
[2019-11-19 20:51:55,656 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:55,656 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 4260 transitions.
[2019-11-19 20:51:55,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4260 transitions.
[2019-11-19 20:51:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2019-11-19 20:51:55,672 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:55,672 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:55,672 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:55,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1536158541, now seen corresponding path program 1 times
[2019-11-19 20:51:55,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:55,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384790704]
[2019-11-19 20:51:55,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2019-11-19 20:51:55,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384790704]
[2019-11-19 20:51:55,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747755341]
[2019-11-19 20:51:55,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:55,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:55,955 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked.
[2019-11-19 20:51:56,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-11-19 20:51:56,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2019-11-19 20:51:56,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325510901]
[2019-11-19 20:51:56,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:56,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:56,114 INFO L87 Difference]: Start difference. First operand 3183 states and 4260 transitions. Second operand 3 states.
[2019-11-19 20:51:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:56,300 INFO L93 Difference]: Finished difference Result 9373 states and 12524 transitions.
[2019-11-19 20:51:56,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:56,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288
[2019-11-19 20:51:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:56,313 INFO L225 Difference]: With dead ends: 9373
[2019-11-19 20:51:56,313 INFO L226 Difference]: Without dead ends: 6197
[2019-11-19 20:51:56,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states.
[2019-11-19 20:51:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6195.
[2019-11-19 20:51:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6195 states.
[2019-11-19 20:51:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6195 states to 6195 states and 8256 transitions.
[2019-11-19 20:51:56,517 INFO L78 Accepts]: Start accepts. Automaton has 6195 states and 8256 transitions. Word has length 288
[2019-11-19 20:51:56,518 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:56,518 INFO L462 AbstractCegarLoop]: Abstraction has 6195 states and 8256 transitions.
[2019-11-19 20:51:56,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6195 states and 8256 transitions.
[2019-11-19 20:51:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2019-11-19 20:51:56,537 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:56,537 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:56,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:56,751 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2096858319, now seen corresponding path program 1 times
[2019-11-19 20:51:56,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:56,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935265]
[2019-11-19 20:51:56,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2019-11-19 20:51:56,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935265]
[2019-11-19 20:51:56,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010344049]
[2019-11-19 20:51:56,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:56,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:56,963 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2019-11-19 20:51:57,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:51:57,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:51:57,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147389128]
[2019-11-19 20:51:57,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:51:57,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:57,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:51:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:51:57,029 INFO L87 Difference]: Start difference. First operand 6195 states and 8256 transitions. Second operand 4 states.
[2019-11-19 20:51:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:57,690 INFO L93 Difference]: Finished difference Result 17795 states and 23500 transitions.
[2019-11-19 20:51:57,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-11-19 20:51:57,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288
[2019-11-19 20:51:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:57,712 INFO L225 Difference]: With dead ends: 17795
[2019-11-19 20:51:57,713 INFO L226 Difference]: Without dead ends: 11451
[2019-11-19 20:51:57,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11451 states.
[2019-11-19 20:51:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11451 to 6339.
[2019-11-19 20:51:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6339 states.
[2019-11-19 20:51:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 8448 transitions.
[2019-11-19 20:51:58,028 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 8448 transitions. Word has length 288
[2019-11-19 20:51:58,029 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:58,029 INFO L462 AbstractCegarLoop]: Abstraction has 6339 states and 8448 transitions.
[2019-11-19 20:51:58,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:51:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 8448 transitions.
[2019-11-19 20:51:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2019-11-19 20:51:58,042 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:58,043 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:58,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:58,256 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1896545040, now seen corresponding path program 1 times
[2019-11-19 20:51:58,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:58,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360946934]
[2019-11-19 20:51:58,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked.
[2019-11-19 20:51:58,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360946934]
[2019-11-19 20:51:58,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19103801]
[2019-11-19 20:51:58,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:58,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:51:58,567 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:51:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked.
[2019-11-19 20:51:58,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:51:58,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:51:58,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293030028]
[2019-11-19 20:51:58,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:51:58,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:58,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:51:58,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:51:58,655 INFO L87 Difference]: Start difference. First operand 6339 states and 8448 transitions. Second operand 4 states.
[2019-11-19 20:51:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:59,245 INFO L93 Difference]: Finished difference Result 14214 states and 18779 transitions.
[2019-11-19 20:51:59,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-11-19 20:51:59,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297
[2019-11-19 20:51:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:59,268 INFO L225 Difference]: With dead ends: 14214
[2019-11-19 20:51:59,268 INFO L226 Difference]: Without dead ends: 7852
[2019-11-19 20:51:59,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:51:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7852 states.
[2019-11-19 20:51:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7852 to 6153.
[2019-11-19 20:51:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states.
[2019-11-19 20:51:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8148 transitions.
[2019-11-19 20:51:59,490 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8148 transitions. Word has length 297
[2019-11-19 20:51:59,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:59,491 INFO L462 AbstractCegarLoop]: Abstraction has 6153 states and 8148 transitions.
[2019-11-19 20:51:59,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:51:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8148 transitions.
[2019-11-19 20:51:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307
[2019-11-19 20:51:59,504 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:59,504 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:59,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:51:59,709 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:59,710 INFO L82 PathProgramCache]: Analyzing trace with hash -231299850, now seen corresponding path program 1 times
[2019-11-19 20:51:59,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:59,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942356206]
[2019-11-19 20:51:59,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked.
[2019-11-19 20:51:59,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942356206]
[2019-11-19 20:51:59,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:59,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:51:59,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606605153]
[2019-11-19 20:51:59,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:59,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:59,809 INFO L87 Difference]: Start difference. First operand 6153 states and 8148 transitions. Second operand 3 states.
[2019-11-19 20:52:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:00,180 INFO L93 Difference]: Finished difference Result 12695 states and 16825 transitions.
[2019-11-19 20:52:00,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:52:00,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306
[2019-11-19 20:52:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:00,193 INFO L225 Difference]: With dead ends: 12695
[2019-11-19 20:52:00,193 INFO L226 Difference]: Without dead ends: 6333
[2019-11-19 20:52:00,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states.
[2019-11-19 20:52:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 6333.
[2019-11-19 20:52:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states.
[2019-11-19 20:52:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 8322 transitions.
[2019-11-19 20:52:00,446 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 8322 transitions. Word has length 306
[2019-11-19 20:52:00,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:00,447 INFO L462 AbstractCegarLoop]: Abstraction has 6333 states and 8322 transitions.
[2019-11-19 20:52:00,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:52:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 8322 transitions.
[2019-11-19 20:52:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319
[2019-11-19 20:52:00,466 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:52:00,467 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:52:00,467 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:52:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:52:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash -707716365, now seen corresponding path program 1 times
[2019-11-19 20:52:00,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:52:00,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615590442]
[2019-11-19 20:52:00,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:52:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked.
[2019-11-19 20:52:00,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615590442]
[2019-11-19 20:52:00,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752668155]
[2019-11-19 20:52:00,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:52:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:00,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:52:00,719 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:52:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked.
[2019-11-19 20:52:00,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:52:00,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:52:00,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990578549]
[2019-11-19 20:52:00,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:52:00,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:52:00,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:52:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:52:00,786 INFO L87 Difference]: Start difference. First operand 6333 states and 8322 transitions. Second operand 4 states.
[2019-11-19 20:52:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:01,235 INFO L93 Difference]: Finished difference Result 13044 states and 16947 transitions.
[2019-11-19 20:52:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-11-19 20:52:01,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318
[2019-11-19 20:52:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:01,247 INFO L225 Difference]: With dead ends: 13044
[2019-11-19 20:52:01,248 INFO L226 Difference]: Without dead ends: 6718
[2019-11-19 20:52:01,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:52:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states.
[2019-11-19 20:52:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 4032.
[2019-11-19 20:52:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states.
[2019-11-19 20:52:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5147 transitions.
[2019-11-19 20:52:01,419 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5147 transitions. Word has length 318
[2019-11-19 20:52:01,420 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:01,420 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5147 transitions.
[2019-11-19 20:52:01,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:52:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5147 transitions.
[2019-11-19 20:52:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322
[2019-11-19 20:52:01,430 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:52:01,431 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:52:01,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:52:01,637 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:52:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:52:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash -899029058, now seen corresponding path program 1 times
[2019-11-19 20:52:01,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:52:01,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132203210]
[2019-11-19 20:52:01,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:52:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked.
[2019-11-19 20:52:01,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132203210]
[2019-11-19 20:52:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:52:01,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:52:01,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276572765]
[2019-11-19 20:52:01,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:52:01,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:52:01,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:52:01,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:01,754 INFO L87 Difference]: Start difference. First operand 4032 states and 5147 transitions. Second operand 3 states.
[2019-11-19 20:52:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:02,036 INFO L93 Difference]: Finished difference Result 8177 states and 10418 transitions.
[2019-11-19 20:52:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:52:02,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321
[2019-11-19 20:52:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:02,044 INFO L225 Difference]: With dead ends: 8177
[2019-11-19 20:52:02,045 INFO L226 Difference]: Without dead ends: 4152
[2019-11-19 20:52:02,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states.
[2019-11-19 20:52:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4032.
[2019-11-19 20:52:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states.
[2019-11-19 20:52:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5069 transitions.
[2019-11-19 20:52:02,300 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5069 transitions. Word has length 321
[2019-11-19 20:52:02,300 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:02,300 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5069 transitions.
[2019-11-19 20:52:02,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:52:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5069 transitions.
[2019-11-19 20:52:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365
[2019-11-19 20:52:02,311 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:52:02,311 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:52:02,312 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:52:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:52:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1605204832, now seen corresponding path program 1 times
[2019-11-19 20:52:02,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:52:02,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175885923]
[2019-11-19 20:52:02,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:52:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2019-11-19 20:52:02,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175885923]
[2019-11-19 20:52:02,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:52:02,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:52:02,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077213411]
[2019-11-19 20:52:02,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:52:02,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:52:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:52:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:02,421 INFO L87 Difference]: Start difference. First operand 4032 states and 5069 transitions. Second operand 3 states.
[2019-11-19 20:52:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:02,667 INFO L93 Difference]: Finished difference Result 7108 states and 8996 transitions.
[2019-11-19 20:52:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:52:02,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364
[2019-11-19 20:52:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:02,674 INFO L225 Difference]: With dead ends: 7108
[2019-11-19 20:52:02,674 INFO L226 Difference]: Without dead ends: 4088
[2019-11-19 20:52:02,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states.
[2019-11-19 20:52:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4032.
[2019-11-19 20:52:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states.
[2019-11-19 20:52:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5063 transitions.
[2019-11-19 20:52:02,800 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5063 transitions. Word has length 364
[2019-11-19 20:52:02,800 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:02,801 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5063 transitions.
[2019-11-19 20:52:02,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:52:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5063 transitions.
[2019-11-19 20:52:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388
[2019-11-19 20:52:02,807 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:52:02,807 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:52:02,808 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:52:02,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:52:02,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1700300854, now seen corresponding path program 1 times
[2019-11-19 20:52:02,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:52:02,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704786626]
[2019-11-19 20:52:02,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:52:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked.
[2019-11-19 20:52:02,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704786626]
[2019-11-19 20:52:02,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:52:02,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:52:02,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470131559]
[2019-11-19 20:52:02,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:52:02,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:52:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:52:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:02,931 INFO L87 Difference]: Start difference. First operand 4032 states and 5063 transitions. Second operand 3 states.
[2019-11-19 20:52:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:03,132 INFO L93 Difference]: Finished difference Result 7064 states and 8910 transitions.
[2019-11-19 20:52:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:52:03,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387
[2019-11-19 20:52:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:03,139 INFO L225 Difference]: With dead ends: 7064
[2019-11-19 20:52:03,139 INFO L226 Difference]: Without dead ends: 4044
[2019-11-19 20:52:03,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states.
[2019-11-19 20:52:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 4032.
[2019-11-19 20:52:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states.
[2019-11-19 20:52:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5057 transitions.
[2019-11-19 20:52:03,264 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5057 transitions. Word has length 387
[2019-11-19 20:52:03,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:03,265 INFO L462 AbstractCegarLoop]: Abstraction has 4032 states and 5057 transitions.
[2019-11-19 20:52:03,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:52:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5057 transitions.
[2019-11-19 20:52:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388
[2019-11-19 20:52:03,271 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:52:03,271 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:52:03,272 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:52:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:52:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -510666558, now seen corresponding path program 1 times
[2019-11-19 20:52:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:52:03,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250443736]
[2019-11-19 20:52:03,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:52:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked.
[2019-11-19 20:52:03,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250443736]
[2019-11-19 20:52:03,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:52:03,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-19 20:52:03,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608739791]
[2019-11-19 20:52:03,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:52:03,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:52:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:52:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:03,450 INFO L87 Difference]: Start difference. First operand 4032 states and 5057 transitions. Second operand 3 states.
[2019-11-19 20:52:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:03,747 INFO L93 Difference]: Finished difference Result 7517 states and 9443 transitions.
[2019-11-19 20:52:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:52:03,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387
[2019-11-19 20:52:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:03,752 INFO L225 Difference]: With dead ends: 7517
[2019-11-19 20:52:03,752 INFO L226 Difference]: Without dead ends: 3371
[2019-11-19 20:52:03,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:52:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states.
[2019-11-19 20:52:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3282.
[2019-11-19 20:52:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states.
[2019-11-19 20:52:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4095 transitions.
[2019-11-19 20:52:03,842 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4095 transitions. Word has length 387
[2019-11-19 20:52:03,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:03,843 INFO L462 AbstractCegarLoop]: Abstraction has 3282 states and 4095 transitions.
[2019-11-19 20:52:03,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:52:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4095 transitions.
[2019-11-19 20:52:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422
[2019-11-19 20:52:03,849 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:52:03,849 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:52:03,850 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:52:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:52:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1519747608, now seen corresponding path program 1 times
[2019-11-19 20:52:03,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:52:03,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807972203]
[2019-11-19 20:52:03,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:52:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked.
[2019-11-19 20:52:04,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807972203]
[2019-11-19 20:52:04,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821735062]
[2019-11-19 20:52:04,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:52:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:52:04,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-11-19 20:52:04,128 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2019-11-19 20:52:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked.
[2019-11-19 20:52:04,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-11-19 20:52:04,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2019-11-19 20:52:04,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017956107]
[2019-11-19 20:52:04,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-19 20:52:04,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:52:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-19 20:52:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-19 20:52:04,231 INFO L87 Difference]: Start difference. First operand 3282 states and 4095 transitions. Second operand 4 states.
[2019-11-19 20:52:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:52:04,434 INFO L93 Difference]: Finished difference Result 5377 states and 6760 transitions.
[2019-11-19 20:52:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-11-19 20:52:04,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421
[2019-11-19 20:52:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:52:04,436 INFO L225 Difference]: With dead ends: 5377
[2019-11-19 20:52:04,436 INFO L226 Difference]: Without dead ends: 0
[2019-11-19 20:52:04,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-19 20:52:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-11-19 20:52:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-11-19 20:52:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-11-19 20:52:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-11-19 20:52:04,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421
[2019-11-19 20:52:04,440 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:52:04,442 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-11-19 20:52:04,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-19 20:52:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-11-19 20:52:04,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-11-19 20:52:04,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-11-19 20:52:04,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-11-19 20:52:04,931 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132
[2019-11-19 20:52:05,173 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 155
[2019-11-19 20:52:07,156 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 618 DAG size of output: 420
[2019-11-19 20:52:08,286 WARN L191 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 618 DAG size of output: 420
[2019-11-19 20:52:09,223 WARN L191 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52
[2019-11-19 20:52:09,994 WARN L191 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79
[2019-11-19 20:52:10,497 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 21
[2019-11-19 20:52:11,104 WARN L191 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 21
[2019-11-19 20:52:11,534 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52
[2019-11-19 20:52:17,328 WARN L191 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 362 DAG size of output: 107
[2019-11-19 20:52:17,843 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 43
[2019-11-19 20:52:18,473 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24
[2019-11-19 20:52:18,960 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 23
[2019-11-19 20:52:19,217 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54
[2019-11-19 20:52:19,961 WARN L191 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 36
[2019-11-19 20:52:25,632 WARN L191 SmtUtils]: Spent 5.66 s on a formula simplification. DAG size of input: 362 DAG size of output: 107
[2019-11-19 20:52:26,058 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 29
[2019-11-19 20:52:26,571 WARN L191 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62
[2019-11-19 20:52:27,185 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24
[2019-11-19 20:52:27,641 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52
[2019-11-19 20:52:28,279 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 28
[2019-11-19 20:52:28,737 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52
[2019-11-19 20:52:29,210 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 38
[2019-11-19 20:52:29,778 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 24
[2019-11-19 20:52:30,377 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58
[2019-11-19 20:52:30,381 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 602) no Hoare annotation was computed.
[2019-11-19 20:52:30,381 INFO L444 ceAbstractionStarter]: For program point L597-2(lines 596 610) no Hoare annotation was computed.
[2019-11-19 20:52:30,381 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 467) no Hoare annotation was computed.
[2019-11-19 20:52:30,381 INFO L440 ceAbstractionStarter]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (and .cse0 .cse1 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2)))
[2019-11-19 20:52:30,382 INFO L440 ceAbstractionStarter]: At program point L102(lines 101 594) the Hoare annotation is: false
[2019-11-19 20:52:30,382 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 502) no Hoare annotation was computed.
[2019-11-19 20:52:30,382 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 601) no Hoare annotation was computed.
[2019-11-19 20:52:30,382 INFO L444 ceAbstractionStarter]: For program point L434-1(lines 434 442) no Hoare annotation was computed.
[2019-11-19 20:52:30,382 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 372) no Hoare annotation was computed.
[2019-11-19 20:52:30,383 INFO L444 ceAbstractionStarter]: For program point L335-1(lines 335 372) no Hoare annotation was computed.
[2019-11-19 20:52:30,383 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 560) no Hoare annotation was computed.
[2019-11-19 20:52:30,383 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 571) no Hoare annotation was computed.
[2019-11-19 20:52:30,383 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 582) no Hoare annotation was computed.
[2019-11-19 20:52:30,383 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 593) no Hoare annotation was computed.
[2019-11-19 20:52:30,384 INFO L440 ceAbstractionStarter]: At program point L402(lines 393 414) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4)))
[2019-11-19 20:52:30,384 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 369) no Hoare annotation was computed.
[2019-11-19 20:52:30,385 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 313) no Hoare annotation was computed.
[2019-11-19 20:52:30,385 INFO L444 ceAbstractionStarter]: For program point L303-2(lines 303 313) no Hoare annotation was computed.
[2019-11-19 20:52:30,385 INFO L440 ceAbstractionStarter]: At program point L204(lines 203 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))
[2019-11-19 20:52:30,385 INFO L440 ceAbstractionStarter]: At program point L171(lines 167 572) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))
[2019-11-19 20:52:30,386 INFO L440 ceAbstractionStarter]: At program point L138(lines 134 583) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12))))
[2019-11-19 20:52:30,386 INFO L444 ceAbstractionStarter]: For program point L535(lines 535 539) no Hoare annotation was computed.
[2019-11-19 20:52:30,386 INFO L444 ceAbstractionStarter]: For program point L535-2(lines 535 539) no Hoare annotation was computed.
[2019-11-19 20:52:30,386 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 440) no Hoare annotation was computed.
[2019-11-19 20:52:30,387 INFO L440 ceAbstractionStarter]: At program point L206(lines 205 560) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))
[2019-11-19 20:52:30,387 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 570) no Hoare annotation was computed.
[2019-11-19 20:52:30,387 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 581) no Hoare annotation was computed.
[2019-11-19 20:52:30,388 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 592) no Hoare annotation was computed.
[2019-11-19 20:52:30,388 INFO L447 ceAbstractionStarter]: At program point L636(lines 627 638) the Hoare annotation is: true
[2019-11-19 20:52:30,388 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 514) no Hoare annotation was computed.
[2019-11-19 20:52:30,388 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed.
[2019-11-19 20:52:30,388 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed.
[2019-11-19 20:52:30,388 INFO L444 ceAbstractionStarter]: For program point L273-2(lines 207 557) no Hoare annotation was computed.
[2019-11-19 20:52:30,389 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 608) no Hoare annotation was computed.
[2019-11-19 20:52:30,389 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 309) no Hoare annotation was computed.
[2019-11-19 20:52:30,389 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 305 313) no Hoare annotation was computed.
[2019-11-19 20:52:30,389 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 367) no Hoare annotation was computed.
[2019-11-19 20:52:30,389 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed.
[2019-11-19 20:52:30,389 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 569) no Hoare annotation was computed.
[2019-11-19 20:52:30,390 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 580) no Hoare annotation was computed.
[2019-11-19 20:52:30,390 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 591) no Hoare annotation was computed.
[2019-11-19 20:52:30,390 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 513) no Hoare annotation was computed.
[2019-11-19 20:52:30,390 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed.
[2019-11-19 20:52:30,390 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed.
[2019-11-19 20:52:30,390 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed.
[2019-11-19 20:52:30,391 INFO L440 ceAbstractionStarter]: At program point L210(lines 104 593) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) .cse1 .cse2) (and (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0) .cse2) .cse1)))
[2019-11-19 20:52:30,391 INFO L440 ceAbstractionStarter]: At program point L177(lines 173 570) the Hoare annotation is: (let ((.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2) .cse0)))
[2019-11-19 20:52:30,391 INFO L440 ceAbstractionStarter]: At program point L144(lines 140 581) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13)))
[2019-11-19 20:52:30,391 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed.
[2019-11-19 20:52:30,391 INFO L444 ceAbstractionStarter]: For program point L344-2(lines 344 348) no Hoare annotation was computed.
[2019-11-19 20:52:30,391 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 568) no Hoare annotation was computed.
[2019-11-19 20:52:30,391 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 579) no Hoare annotation was computed.
[2019-11-19 20:52:30,391 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 590) no Hoare annotation was computed.
[2019-11-19 20:52:30,391 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed.
[2019-11-19 20:52:30,392 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 207 557) no Hoare annotation was computed.
[2019-11-19 20:52:30,392 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed.
[2019-11-19 20:52:30,392 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 551) no Hoare annotation was computed.
[2019-11-19 20:52:30,392 INFO L444 ceAbstractionStarter]: For program point L545-1(lines 545 551) no Hoare annotation was computed.
[2019-11-19 20:52:30,392 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed.
[2019-11-19 20:52:30,392 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 567) no Hoare annotation was computed.
[2019-11-19 20:52:30,393 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 578) no Hoare annotation was computed.
[2019-11-19 20:52:30,393 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed.
[2019-11-19 20:52:30,393 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 589) no Hoare annotation was computed.
[2019-11-19 20:52:30,393 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 416) no Hoare annotation was computed.
[2019-11-19 20:52:30,393 INFO L440 ceAbstractionStarter]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse5 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8))))
[2019-11-19 20:52:30,394 INFO L440 ceAbstractionStarter]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13)))
[2019-11-19 20:52:30,394 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed.
[2019-11-19 20:52:30,394 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed.
[2019-11-19 20:52:30,394 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 450) no Hoare annotation was computed.
[2019-11-19 20:52:30,395 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 388) no Hoare annotation was computed.
[2019-11-19 20:52:30,395 INFO L447 ceAbstractionStarter]: At program point L614(lines 97 615) the Hoare annotation is: true
[2019-11-19 20:52:30,395 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed.
[2019-11-19 20:52:30,395 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed.
[2019-11-19 20:52:30,395 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 566) no Hoare annotation was computed.
[2019-11-19 20:52:30,395 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 577) no Hoare annotation was computed.
[2019-11-19 20:52:30,396 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 588) no Hoare annotation was computed.
[2019-11-19 20:52:30,396 INFO L444 ceAbstractionStarter]: For program point L483(lines 483 485) no Hoare annotation was computed.
[2019-11-19 20:52:30,396 INFO L440 ceAbstractionStarter]: At program point L120(lines 116 589) the Hoare annotation is: (let ((.cse1 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse4 .cse0 .cse3)))
[2019-11-19 20:52:30,396 INFO L440 ceAbstractionStarter]: At program point L484(lines 71 625) the Hoare annotation is: false
[2019-11-19 20:52:30,396 INFO L444 ceAbstractionStarter]: For program point L451(lines 451 460) no Hoare annotation was computed.
[2019-11-19 20:52:30,397 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 363) no Hoare annotation was computed.
[2019-11-19 20:52:30,397 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 288) no Hoare annotation was computed.
[2019-11-19 20:52:30,397 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed.
[2019-11-19 20:52:30,397 INFO L444 ceAbstractionStarter]: For program point L286-2(lines 207 557) no Hoare annotation was computed.
[2019-11-19 20:52:30,397 INFO L440 ceAbstractionStarter]: At program point L353(lines 329 374) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse13 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13)))
[2019-11-19 20:52:30,398 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 565) no Hoare annotation was computed.
[2019-11-19 20:52:30,398 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 576) no Hoare annotation was computed.
[2019-11-19 20:52:30,398 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 587) no Hoare annotation was computed.
[2019-11-19 20:52:30,398 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed.
[2019-11-19 20:52:30,398 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 71 625) no Hoare annotation was computed.
[2019-11-19 20:52:30,398 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 488) no Hoare annotation was computed.
[2019-11-19 20:52:30,399 INFO L440 ceAbstractionStarter]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse3 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 .cse3) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2) .cse3) (and (and .cse2 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse4)) .cse3) (and .cse1 .cse2 .cse3 (and .cse0 .cse4))))
[2019-11-19 20:52:30,399 INFO L440 ceAbstractionStarter]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4)))
[2019-11-19 20:52:30,399 INFO L440 ceAbstractionStarter]: At program point L123(lines 122 587) the Hoare annotation is: (let ((.cse11 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse14 .cse15) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))))
[2019-11-19 20:52:30,399 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed.
[2019-11-19 20:52:30,399 INFO L444 ceAbstractionStarter]: For program point L619(lines 619 621) no Hoare annotation was computed.
[2019-11-19 20:52:30,400 INFO L444 ceAbstractionStarter]: For program point L619-2(lines 619 621) no Hoare annotation was computed.
[2019-11-19 20:52:30,400 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 523) no Hoare annotation was computed.
[2019-11-19 20:52:30,400 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 357) no Hoare annotation was computed.
[2019-11-19 20:52:30,400 INFO L444 ceAbstractionStarter]: For program point L355-2(lines 352 361) no Hoare annotation was computed.
[2019-11-19 20:52:30,400 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-11-19 20:52:30,400 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed.
[2019-11-19 20:52:30,401 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed.
[2019-11-19 20:52:30,401 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 207 557) no Hoare annotation was computed.
[2019-11-19 20:52:30,401 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 564) no Hoare annotation was computed.
[2019-11-19 20:52:30,401 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 575) no Hoare annotation was computed.
[2019-11-19 20:52:30,401 INFO L444 ceAbstractionStarter]: For program point L125(lines 125 586) no Hoare annotation was computed.
[2019-11-19 20:52:30,401 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed.
[2019-11-19 20:52:30,402 INFO L444 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed.
[2019-11-19 20:52:30,402 INFO L440 ceAbstractionStarter]: At program point L390(lines 381 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4)))
[2019-11-19 20:52:30,402 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed.
[2019-11-19 20:52:30,402 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed.
[2019-11-19 20:52:30,402 INFO L444 ceAbstractionStarter]: For program point L225-2(lines 207 557) no Hoare annotation was computed.
[2019-11-19 20:52:30,402 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed.
[2019-11-19 20:52:30,403 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed.
[2019-11-19 20:52:30,403 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-11-19 20:52:30,403 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed.
[2019-11-19 20:52:30,403 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 563) no Hoare annotation was computed.
[2019-11-19 20:52:30,403 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 574) no Hoare annotation was computed.
[2019-11-19 20:52:30,403 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 585) no Hoare annotation was computed.
[2019-11-19 20:52:30,404 INFO L447 ceAbstractionStarter]: At program point L624(lines 10 626) the Hoare annotation is: true
[2019-11-19 20:52:30,404 INFO L440 ceAbstractionStarter]: At program point L558(lines 98 613) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse28 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse23 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse25 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (and (and .cse6 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse8 .cse9 .cse16 .cse17 .cse13 .cse18 .cse19 .cse20 .cse21) .cse4) (and .cse4 .cse5 .cse22 .cse23 .cse3) (and .cse4 (and .cse6 .cse15 .cse8 .cse16 .cse17 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and .cse0 .cse1 .cse23) (and .cse8 .cse10 .cse14 .cse24 .cse25 .cse11 .cse12 .cse13 .cse2) (and .cse4 (and .cse15 .cse8 .cse16 .cse17 .cse24 .cse25 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and (and .cse6 .cse26 .cse1 .cse27) .cse28) (and .cse0 .cse1 .cse25 .cse2) (and .cse29 .cse22 .cse23 .cse3) (and .cse29 .cse6) (and .cse22 .cse23 .cse3 .cse14 .cse28) (and (and .cse26 .cse1 .cse24 .cse27 .cse25 .cse2) .cse28) (and .cse29 (and .cse24 .cse25 .cse2)) (and .cse26 .cse28 .cse1 .cse27 .cse23 .cse2 .cse3) (and .cse29 .cse2 .cse3) (and .cse6 .cse30 .cse20 .cse2) (and .cse30 .cse24 .cse25 .cse20 .cse2)))
[2019-11-19 20:52:30,404 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed.
[2019-11-19 20:52:30,405 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 414) no Hoare annotation was computed.
[2019-11-19 20:52:30,405 INFO L440 ceAbstractionStarter]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse4 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse5 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (and .cse0 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) .cse1 .cse2 .cse3) .cse4) .cse5) (and (and .cse0 (and .cse1 .cse2 .cse3) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse5) (and (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3)) .cse5)))
[2019-11-19 20:52:30,405 INFO L440 ceAbstractionStarter]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4)))
[2019-11-19 20:52:30,405 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 400) no Hoare annotation was computed.
[2019-11-19 20:52:30,405 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 562) no Hoare annotation was computed.
[2019-11-19 20:52:30,406 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 573) no Hoare annotation was computed.
[2019-11-19 20:52:30,406 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 584) no Hoare annotation was computed.
[2019-11-19 20:52:30,406 INFO L440 ceAbstractionStarter]: At program point L98-2(lines 98 613) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse10 (<= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse22 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse28 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse23 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse30 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse24 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7)) (.cse25 (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse20 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (and (and .cse6 .cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse8 .cse9 .cse16 .cse17 .cse13 .cse18 .cse19 .cse20 .cse21) .cse4) (and .cse4 .cse5 .cse22 .cse23 .cse3) (and .cse4 (and .cse6 .cse15 .cse8 .cse16 .cse17 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and .cse0 .cse1 .cse23) (and .cse8 .cse10 .cse14 .cse24 .cse25 .cse11 .cse12 .cse13 .cse2) (and .cse4 (and .cse15 .cse8 .cse16 .cse17 .cse24 .cse25 .cse13 .cse2 .cse18 .cse19 .cse20 .cse21)) (and (and .cse6 .cse26 .cse1 .cse27) .cse28) (and .cse0 .cse1 .cse25 .cse2) (and .cse29 .cse22 .cse23 .cse3) (and .cse29 .cse6) (and .cse22 .cse23 .cse3 .cse14 .cse28) (and (and .cse26 .cse1 .cse24 .cse27 .cse25 .cse2) .cse28) (and .cse29 (and .cse24 .cse25 .cse2)) (and .cse26 .cse28 .cse1 .cse27 .cse23 .cse2 .cse3) (and .cse29 .cse2 .cse3) (and .cse6 .cse30 .cse20 .cse2) (and .cse30 .cse24 .cse25 .cse20 .cse2)))
[2019-11-19 20:52:30,407 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed.
[2019-11-19 20:52:30,407 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 530) no Hoare annotation was computed.
[2019-11-19 20:52:30,407 INFO L444 ceAbstractionStarter]: For program point L528-2(lines 207 557) no Hoare annotation was computed.
[2019-11-19 20:52:30,407 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed.
[2019-11-19 20:52:30,407 INFO L440 ceAbstractionStarter]: At program point L165(lines 164 573) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and .cse0 .cse1 (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640))))
[2019-11-19 20:52:30,408 INFO L440 ceAbstractionStarter]: At program point L132(lines 125 586) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 7) (<= 6 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse11 .cse12 .cse13 .cse14)) (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))
[2019-11-19 20:52:30,408 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed.
[2019-11-19 20:52:30,408 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 611) no Hoare annotation was computed.
[2019-11-19 20:52:30,408 INFO L444 ceAbstractionStarter]: For program point L596(lines 596 610) no Hoare annotation was computed.
[2019-11-19 20:52:30,409 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 373) no Hoare annotation was computed.
[2019-11-19 20:52:30,409 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 561) no Hoare annotation was computed.
[2019-11-19 20:52:30,409 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 572) no Hoare annotation was computed.
[2019-11-19 20:52:30,409 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 583) no Hoare annotation was computed.
[2019-11-19 20:52:30,409 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 594) no Hoare annotation was computed.
[2019-11-19 20:52:30,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:52:30 BoogieIcfgContainer
[2019-11-19 20:52:30,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-11-19 20:52:30,456 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2019-11-19 20:52:30,457 INFO L271 PluginConnector]: Initializing Witness Printer...
[2019-11-19 20:52:30,460 INFO L275 PluginConnector]: Witness Printer initialized
[2019-11-19 20:52:30,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:44" (3/4) ...
[2019-11-19 20:52:30,464 INFO L137 WitnessPrinter]: Generating witness for correct program
[2019-11-19 20:52:30,484 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2019-11-19 20:52:30,485 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2019-11-19 20:52:30,591 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2019-11-19 20:52:30,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2019-11-19 20:52:30,593 INFO L168 Benchmark]: Toolchain (without parser) took 47276.04 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 957.7 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 655.6 MB. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,593 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,594 INFO L168 Benchmark]: Boogie Preprocessor took 46.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,595 INFO L168 Benchmark]: RCFGBuilder took 873.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,595 INFO L168 Benchmark]: TraceAbstraction took 45679.01 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,595 INFO L168 Benchmark]: Witness Printer took 135.17 ms. Allocated memory is still 2.9 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:52:30,597 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 472.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 64.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
* Boogie Preprocessor took 46.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB.
* RCFGBuilder took 873.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB.
* TraceAbstraction took 45679.01 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB.
* Witness Printer took 135.17 ms. Allocated memory is still 2.9 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 623]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 71]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 140]: Loop Invariant
Derived loop invariant: (((((((((((((((!(s__state == 8528) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)
- InvariantResult [Line: 101]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 173]: Loop Invariant
Derived loop invariant: (s__state <= 8640 && (((blastFlag <= 7 && 6 <= blastFlag) && 8544 <= s__state) && ((((((((((((((((((!(s__state == 8608) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8480)) && 0 == s__hit) || (((blastFlag <= 2 && 8544 <= s__state) && ((((((((((((((((((!(s__state == 8608) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8641)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8480)) && s__state <= 8640)
- InvariantResult [Line: 104]: Loop Invariant
Derived loop invariant: ((((blastFlag <= 7 && 6 <= blastFlag) && !(s__state == 8448)) && s__state <= 8448) && 0 == s__hit) || (((blastFlag <= 2 && !(s__state == 8448)) && 0 == s__hit) && s__state <= 8448)
- InvariantResult [Line: 197]: Loop Invariant
Derived loop invariant: (((8672 <= s__state && !(s__state == 12292)) && blastFlag <= 4) || (((8672 <= s__state && !(s__state == 12292)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((8672 <= s__state && !(s__state == 12292)) && 6 <= blastFlag) && 0 == s__hit)
- InvariantResult [Line: 134]: Loop Invariant
Derived loop invariant: (8448 <= s__state && (((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) || (8448 <= s__state && (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480))
- InvariantResult [Line: 98]: Loop Invariant
Derived loop invariant: (((((((((((((((((((((8672 <= s__state && s__state <= 8672) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) || (((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__state <= 8640)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (8448 <= s__state && (((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((8672 <= s__state && s__state <= 8672) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && 8544 <= s__state) && s__state <= 8640) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || (8448 <= s__state && ((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((blastFlag <= 2 && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (((8672 <= s__state && s__state <= 8672) && 6 <= blastFlag) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (s__state <= 3 && blastFlag <= 2)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((!(s__state == 8641) && s__state <= 8672) && blastFlag <= 7) && !(s__state == 8657)) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (s__state <= 3 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit)) || ((((((!(s__state == 8641) && 8640 <= s__state) && s__state <= 8672) && !(s__state == 8657)) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || ((s__state <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit)
- InvariantResult [Line: 167]: Loop Invariant
Derived loop invariant: (((((((((((blastFlag <= 2 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) || (((((((((((((!(s__state == 8608) && !(s__state == 8592)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)
- InvariantResult [Line: 393]: Loop Invariant
Derived loop invariant: ((((((!(s__state == 8560) && !(s__state == 8561)) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && 8544 <= s__state) && 0 == s__hit) && s__state <= 8576)
- InvariantResult [Line: 203]: Loop Invariant
Derived loop invariant: !(s__state == 8544)
- InvariantResult [Line: 627]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 158]: Loop Invariant
Derived loop invariant: ((((((!(s__state == 8544) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8545)) && 0 == s__hit) && s__state <= 8576)
- InvariantResult [Line: 97]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 116]: Loop Invariant
Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8576 && (((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8497)) && (((!(s__state == 8544) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit) || (((((blastFlag <= 2 && (((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8497)) && (((!(s__state == 8544) && !(s__state == 8529)) && !(s__state == 8448)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8496)) && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)
- InvariantResult [Line: 191]: Loop Invariant
Derived loop invariant: (((((s__state <= 8672 && 6 <= blastFlag) && ((blastFlag <= 7 && !(s__state == 8672)) && !(s__state == 8641)) && !(s__state == 8640)) && 0 == s__hit) && 8640 <= s__state) || (((((s__state <= 8672 && (!(s__state == 8672) && !(s__state == 8641)) && !(s__state == 8640)) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) && 8640 <= s__state)) || ((s__state <= 8672 && ((blastFlag <= 2 && !(s__state == 8672)) && !(s__state == 8641)) && !(s__state == 8640)) && 8640 <= s__state)
- InvariantResult [Line: 205]: Loop Invariant
Derived loop invariant: !(s__state == 8544)
- InvariantResult [Line: 98]: Loop Invariant
Derived loop invariant: (((((((((((((((((((((8672 <= s__state && s__state <= 8672) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640) || (((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__state <= 8640)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (8448 <= s__state && (((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((8672 <= s__state && s__state <= 8672) && blastFlag <= 4)) || ((((((((!(s__state == 8561) && 8544 <= s__state) && s__state <= 8640) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit)) || (8448 <= s__state && ((((((((((!(s__state == 8513) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || ((((blastFlag <= 2 && !(s__state == 8641)) && s__state <= 8672) && !(s__state == 8657)) && 8640 <= s__state)) || (((8672 <= s__state && s__state <= 8672) && 6 <= blastFlag) && 0 == s__hit)) || (((s__state <= 3 && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)) || (s__state <= 3 && blastFlag <= 2)) || ((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state)) || ((((((!(s__state == 8641) && s__state <= 8672) && blastFlag <= 7) && !(s__state == 8657)) && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (s__state <= 3 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit)) || ((((((!(s__state == 8641) && 8640 <= s__state) && s__state <= 8672) && !(s__state == 8657)) && blastFlag <= 4) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || ((s__state <= 3 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8640)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit)) || ((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 7) && 6 <= blastFlag) && s__state <= 8576) && 0 == s__hit)
- InvariantResult [Line: 164]: Loop Invariant
Derived loop invariant: ((((((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) || (((((8448 <= s__state && s__state <= 8448) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576)) || (((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3)) || ((((8448 <= s__state && s__state <= 8448) && 8640 <= s__s3__tmp__next_state___0) && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640)
- InvariantResult [Line: 122]: Loop Invariant
Derived loop invariant: (((((((((((((((((8448 <= s__state && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8480)) || (8448 <= s__state && (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))) || (8448 <= s__state && (((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))
- InvariantResult [Line: 152]: Loop Invariant
Derived loop invariant: ((((((!(s__state == 8560) && !(s__state == 8561)) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && 8544 <= s__state) && 0 == s__hit) && s__state <= 8576)
- InvariantResult [Line: 329]: Loop Invariant
Derived loop invariant: (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)
- InvariantResult [Line: 185]: Loop Invariant
Derived loop invariant: ((((((8640 <= s__s3__tmp__next_state___0 && blastFlag <= 4) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && 8640 <= s__state) || ((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state)) || ((s__state <= 8640 && (blastFlag <= 7 && 6 <= blastFlag) && 0 == s__hit) && 8640 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && blastFlag <= 4 && 0 == s__hit)
- InvariantResult [Line: 146]: Loop Invariant
Derived loop invariant: (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state) || ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) && 8448 <= s__state)
- InvariantResult [Line: 179]: Loop Invariant
Derived loop invariant: (((((((((((!(s__state == 8592) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && s__state <= 8640) && !(s__state == 8640)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8593)) && !(s__state == 8545)) && 0 == s__hit) || (s__state <= 8640 && (((((((blastFlag <= 2 && !(s__state == 8592)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && 8544 <= s__state) && !(s__state == 8640)) && !(s__state == 8593)) && !(s__state == 8545))
- InvariantResult [Line: 381]: Loop Invariant
Derived loop invariant: ((((((!(s__state == 8560) && !(s__state == 8561)) && 8544 <= s__state) && blastFlag <= 7) && 6 <= blastFlag) && 0 == s__hit) && s__state <= 8576) || (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && 8544 <= s__state) && 0 == s__hit) && s__state <= 8576)
- InvariantResult [Line: 10]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 125]: Loop Invariant
Derived loop invariant: (8448 <= s__state && (((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && blastFlag <= 7) && 6 <= blastFlag) && !(s__state == 8545)) && 0 == s__hit) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480)) || (8448 <= s__state && (((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8480))
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 145 locations, 1 error locations. Result: SAFE, OverallTime: 45.5s, OverallIterations: 43, TraceHistogramMax: 14, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.7s, HoareTripleCheckerStatistics: 7875 SDtfs, 6018 SDslu, 3426 SDs, 0 SdLazy, 4127 SolverSat, 1427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1852 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6339occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 10655 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 263 NumberOfFragments, 2683 HoareAnnotationTreeSize, 28 FomulaSimplifications, 395346 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 28 FomulaSimplificationsInter, 109604 FormulaSimplificationTreeSizeReductionInter, 21.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 8758 NumberOfCodeBlocks, 8758 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 8709 ConstructedInterpolants, 0 QuantifiedInterpolants, 3026590 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3004 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 49 InterpolantComputations, 39 PerfectInterpolantSequences, 21964/22196 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...