./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c83e1c64d2af1ac92027e4b29fb95a984369de1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:52:24,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:52:24,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:52:24,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:52:24,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:52:24,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:52:24,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:52:24,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:52:24,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:52:24,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:52:24,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:52:24,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:52:24,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:52:24,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:52:24,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:52:24,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:52:24,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:52:24,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:52:24,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:52:24,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:52:24,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:52:24,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:52:24,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:52:24,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:52:24,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:52:24,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:52:24,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:52:24,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:52:24,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:52:24,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:52:24,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:52:24,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:52:24,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:52:24,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:52:24,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:52:24,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:52:24,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:52:24,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:52:24,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:52:24,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:52:24,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:52:24,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-20 04:52:24,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:52:24,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:52:24,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:52:24,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:52:24,375 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:52:24,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:52:24,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:52:24,375 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 04:52:24,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:52:24,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:52:24,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:52:24,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:52:24,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:52:24,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:52:24,377 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 04:52:24,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:52:24,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:52:24,377 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:52:24,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:52:24,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:52:24,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:52:24,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:52:24,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:52:24,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:52:24,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:52:24,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:52:24,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:52:24,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:52:24,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:52:24,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:52:24,380 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer 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 ! overflow) ) 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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-20 04:52:24,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:52:24,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:52:24,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:52:24,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:52:24,555 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:52:24,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-20 04:52:24,606 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/data/959764209/aa368a4e1d3f40d2b03d4afccaf5f5cf/FLAG54ee6d4a8 [2019-11-20 04:52:25,063 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:52:25,063 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-20 04:52:25,075 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/data/959764209/aa368a4e1d3f40d2b03d4afccaf5f5cf/FLAG54ee6d4a8 [2019-11-20 04:52:25,093 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/data/959764209/aa368a4e1d3f40d2b03d4afccaf5f5cf [2019-11-20 04:52:25,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:52:25,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:52:25,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:52:25,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:52:25,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:52:25,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332ee523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25, skipping insertion in model container [2019-11-20 04:52:25,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,118 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:52:25,180 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:52:25,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:52:25,528 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:52:25,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:52:25,594 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:52:25,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25 WrapperNode [2019-11-20 04:52:25,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:52:25,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:52:25,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:52:25,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:52:25,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:52:25,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:52:25,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:52:25,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:52:25,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... [2019-11-20 04:52:25,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:52:25,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:52:25,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:52:25,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:52:25,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:25,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:52:25,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:52:25,863 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 04:52:26,471 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 04:52:26,472 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 04:52:26,473 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:52:26,473 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:52:26,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:52:26 BoogieIcfgContainer [2019-11-20 04:52:26,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:52:26,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:52:26,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:52:26,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:52:26,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:52:25" (1/3) ... [2019-11-20 04:52:26,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77faf746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:52:26, skipping insertion in model container [2019-11-20 04:52:26,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:52:25" (2/3) ... [2019-11-20 04:52:26,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77faf746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:52:26, skipping insertion in model container [2019-11-20 04:52:26,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:52:26" (3/3) ... [2019-11-20 04:52:26,486 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-20 04:52:26,494 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:52:26,501 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-20 04:52:26,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-20 04:52:26,554 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:52:26,554 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:52:26,554 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:52:26,554 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:52:26,554 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:52:26,555 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:52:26,555 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:52:26,555 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:52:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-20 04:52:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 04:52:26,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:26,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:26,583 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-11-20 04:52:26,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:26,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108186456] [2019-11-20 04:52:26,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:26,764 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-20 04:52:26,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108186456] [2019-11-20 04:52:26,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:26,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:26,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598400673] [2019-11-20 04:52:26,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:26,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:26,786 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-20 04:52:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:27,027 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-11-20 04:52:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:27,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 04:52:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:27,046 INFO L225 Difference]: With dead ends: 323 [2019-11-20 04:52:27,046 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 04:52:27,051 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-20 04:52:27,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 04:52:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-20 04:52:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-20 04:52:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-11-20 04:52:27,100 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-11-20 04:52:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:27,101 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-11-20 04:52:27,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-11-20 04:52:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 04:52:27,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:27,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:27,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-11-20 04:52:27,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:27,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433949656] [2019-11-20 04:52:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:27,145 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-20 04:52:27,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433949656] [2019-11-20 04:52:27,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:27,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:27,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604555185] [2019-11-20 04:52:27,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:27,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:27,148 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-11-20 04:52:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:27,335 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-11-20 04:52:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:27,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 04:52:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:27,338 INFO L225 Difference]: With dead ends: 313 [2019-11-20 04:52:27,339 INFO L226 Difference]: Without dead ends: 165 [2019-11-20 04:52:27,340 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-20 04:52:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-20 04:52:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-11-20 04:52:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-20 04:52:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-11-20 04:52:27,373 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-11-20 04:52:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:27,373 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-11-20 04:52:27,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-11-20 04:52:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:52:27,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:27,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:27,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-11-20 04:52:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:27,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312003291] [2019-11-20 04:52:27,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:27,458 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-20 04:52:27,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312003291] [2019-11-20 04:52:27,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:27,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:27,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529696956] [2019-11-20 04:52:27,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:27,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:27,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:27,460 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-11-20 04:52:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:27,622 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-11-20 04:52:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:27,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 04:52:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:27,626 INFO L225 Difference]: With dead ends: 315 [2019-11-20 04:52:27,626 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 04:52:27,627 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-20 04:52:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 04:52:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-11-20 04:52:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-20 04:52:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-11-20 04:52:27,641 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-11-20 04:52:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:27,641 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-11-20 04:52:27,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-11-20 04:52:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 04:52:27,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:27,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:27,643 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-11-20 04:52:27,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:27,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505326576] [2019-11-20 04:52:27,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:27,709 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-20 04:52:27,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505326576] [2019-11-20 04:52:27,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:27,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:27,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474760344] [2019-11-20 04:52:27,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:27,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:27,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:27,711 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-11-20 04:52:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:27,884 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-11-20 04:52:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 04:52:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:27,887 INFO L225 Difference]: With dead ends: 317 [2019-11-20 04:52:27,887 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 04:52:27,888 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-20 04:52:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 04:52:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-11-20 04:52:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-20 04:52:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-11-20 04:52:27,902 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-11-20 04:52:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:27,902 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-11-20 04:52:27,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-11-20 04:52:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:52:27,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:27,904 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] [2019-11-20 04:52:27,904 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-11-20 04:52:27,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:27,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157906968] [2019-11-20 04:52:27,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:27,947 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-20 04:52:27,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157906968] [2019-11-20 04:52:27,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:27,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:27,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596423327] [2019-11-20 04:52:27,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:27,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:27,950 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-11-20 04:52:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:28,095 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-11-20 04:52:28,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:28,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 04:52:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:28,096 INFO L225 Difference]: With dead ends: 319 [2019-11-20 04:52:28,096 INFO L226 Difference]: Without dead ends: 168 [2019-11-20 04:52:28,097 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-20 04:52:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-20 04:52:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-11-20 04:52:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-20 04:52:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-11-20 04:52:28,108 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-11-20 04:52:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:28,108 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-11-20 04:52:28,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-11-20 04:52:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 04:52:28,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:28,116 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-20 04:52:28,116 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-11-20 04:52:28,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:28,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278913778] [2019-11-20 04:52:28,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:28,138 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:28,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306230129] [2019-11-20 04:52:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:28,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:52:28,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:28,263 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-20 04:52:28,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278913778] [2019-11-20 04:52:28,264 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:28,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306230129] [2019-11-20 04:52:28,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:28,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:28,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952587931] [2019-11-20 04:52:28,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:28,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:28,266 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-11-20 04:52:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:28,305 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-11-20 04:52:28,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:28,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 04:52:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:28,308 INFO L225 Difference]: With dead ends: 455 [2019-11-20 04:52:28,309 INFO L226 Difference]: Without dead ends: 303 [2019-11-20 04:52:28,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-20 04:52:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-20 04:52:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-11-20 04:52:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-20 04:52:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-11-20 04:52:28,325 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-11-20 04:52:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:28,325 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-11-20 04:52:28,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-11-20 04:52:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 04:52:28,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:28,328 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 04:52:28,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:28,532 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-11-20 04:52:28,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:28,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640786525] [2019-11-20 04:52:28,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:52:28,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640786525] [2019-11-20 04:52:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:28,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:28,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903317882] [2019-11-20 04:52:28,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:28,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:28,587 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-11-20 04:52:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:28,775 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-11-20 04:52:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:28,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 04:52:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:28,780 INFO L225 Difference]: With dead ends: 653 [2019-11-20 04:52:28,781 INFO L226 Difference]: Without dead ends: 361 [2019-11-20 04:52:28,781 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-20 04:52:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-20 04:52:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-11-20 04:52:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-20 04:52:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-11-20 04:52:28,803 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-11-20 04:52:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:28,804 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-11-20 04:52:28,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-11-20 04:52:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 04:52:28,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:28,807 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 04:52:28,807 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:28,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-11-20 04:52:28,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:28,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27628471] [2019-11-20 04:52:28,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:28,821 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:28,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075158767] [2019-11-20 04:52:28,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:28,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:52:28,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:52:28,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27628471] [2019-11-20 04:52:28,930 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:28,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075158767] [2019-11-20 04:52:28,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:28,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:28,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482532495] [2019-11-20 04:52:28,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:28,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:28,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:28,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:28,933 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-11-20 04:52:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:28,981 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-11-20 04:52:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:28,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-20 04:52:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:28,986 INFO L225 Difference]: With dead ends: 719 [2019-11-20 04:52:28,986 INFO L226 Difference]: Without dead ends: 536 [2019-11-20 04:52:28,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-20 04:52:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-20 04:52:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-11-20 04:52:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-20 04:52:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-11-20 04:52:29,008 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-11-20 04:52:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:29,009 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-11-20 04:52:29,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-11-20 04:52:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 04:52:29,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:29,011 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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-20 04:52:29,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:29,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-11-20 04:52:29,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:29,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884549279] [2019-11-20 04:52:29,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:29,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884549279] [2019-11-20 04:52:29,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:29,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:29,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986963429] [2019-11-20 04:52:29,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:29,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:29,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:29,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:29,259 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-11-20 04:52:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:29,411 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-11-20 04:52:29,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:29,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 04:52:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:29,415 INFO L225 Difference]: With dead ends: 1111 [2019-11-20 04:52:29,415 INFO L226 Difference]: Without dead ends: 586 [2019-11-20 04:52:29,416 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-20 04:52:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-20 04:52:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-11-20 04:52:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-20 04:52:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-11-20 04:52:29,438 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-11-20 04:52:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:29,439 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-11-20 04:52:29,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-11-20 04:52:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 04:52:29,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:29,441 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 04:52:29,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-11-20 04:52:29,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:29,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409023248] [2019-11-20 04:52:29,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:29,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409023248] [2019-11-20 04:52:29,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:29,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:29,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036956629] [2019-11-20 04:52:29,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:29,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:29,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:29,480 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-11-20 04:52:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:29,628 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-11-20 04:52:29,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:29,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-20 04:52:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:29,633 INFO L225 Difference]: With dead ends: 1162 [2019-11-20 04:52:29,633 INFO L226 Difference]: Without dead ends: 589 [2019-11-20 04:52:29,634 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-20 04:52:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-20 04:52:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-11-20 04:52:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-20 04:52:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-11-20 04:52:29,658 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-11-20 04:52:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:29,658 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-11-20 04:52:29,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-11-20 04:52:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-20 04:52:29,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:29,660 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 04:52:29,661 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-11-20 04:52:29,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:29,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507357287] [2019-11-20 04:52:29,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:29,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507357287] [2019-11-20 04:52:29,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:29,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:29,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175449833] [2019-11-20 04:52:29,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:29,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:29,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:29,717 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-11-20 04:52:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:29,903 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-11-20 04:52:29,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:29,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-20 04:52:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:29,908 INFO L225 Difference]: With dead ends: 1291 [2019-11-20 04:52:29,908 INFO L226 Difference]: Without dead ends: 715 [2019-11-20 04:52:29,909 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-20 04:52:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-20 04:52:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-11-20 04:52:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-11-20 04:52:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-11-20 04:52:29,939 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-11-20 04:52:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:29,939 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-11-20 04:52:29,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-11-20 04:52:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 04:52:29,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:29,941 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 04:52:29,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-11-20 04:52:29,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:29,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263549570] [2019-11-20 04:52:29,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:29,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263549570] [2019-11-20 04:52:29,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:29,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:29,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644888879] [2019-11-20 04:52:29,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:29,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:29,999 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-11-20 04:52:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:30,184 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-11-20 04:52:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:30,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 04:52:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:30,190 INFO L225 Difference]: With dead ends: 1513 [2019-11-20 04:52:30,190 INFO L226 Difference]: Without dead ends: 811 [2019-11-20 04:52:30,195 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-20 04:52:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-20 04:52:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-11-20 04:52:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-20 04:52:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-11-20 04:52:30,227 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-11-20 04:52:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:30,229 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-11-20 04:52:30,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-11-20 04:52:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 04:52:30,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:30,231 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 04:52:30,231 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:30,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-11-20 04:52:30,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:30,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568968385] [2019-11-20 04:52:30,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:30,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568968385] [2019-11-20 04:52:30,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:30,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:30,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968412146] [2019-11-20 04:52:30,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:30,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:30,271 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-11-20 04:52:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:30,453 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-11-20 04:52:30,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:30,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 04:52:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:30,458 INFO L225 Difference]: With dead ends: 1582 [2019-11-20 04:52:30,459 INFO L226 Difference]: Without dead ends: 799 [2019-11-20 04:52:30,460 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-20 04:52:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-11-20 04:52:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-11-20 04:52:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-20 04:52:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-11-20 04:52:30,493 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-11-20 04:52:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:30,494 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-11-20 04:52:30,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-11-20 04:52:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 04:52:30,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:30,496 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 04:52:30,497 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-11-20 04:52:30,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:30,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715582345] [2019-11-20 04:52:30,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:30,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715582345] [2019-11-20 04:52:30,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:30,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:30,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362112349] [2019-11-20 04:52:30,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:30,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:30,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:30,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:30,531 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-11-20 04:52:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:30,718 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-11-20 04:52:30,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:30,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 04:52:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:30,723 INFO L225 Difference]: With dead ends: 1600 [2019-11-20 04:52:30,724 INFO L226 Difference]: Without dead ends: 814 [2019-11-20 04:52:30,725 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-20 04:52:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-11-20 04:52:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-11-20 04:52:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-11-20 04:52:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-11-20 04:52:30,760 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-11-20 04:52:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:30,760 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-11-20 04:52:30,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-11-20 04:52:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 04:52:30,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:30,762 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:30,763 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-11-20 04:52:30,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:30,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857262450] [2019-11-20 04:52:30,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:30,771 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:30,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689723776] [2019-11-20 04:52:30,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:30,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:52:30,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 04:52:30,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857262450] [2019-11-20 04:52:30,857 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:30,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689723776] [2019-11-20 04:52:30,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:30,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:30,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4927120] [2019-11-20 04:52:30,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:30,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:30,859 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-11-20 04:52:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:30,933 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-11-20 04:52:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:30,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-20 04:52:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:30,941 INFO L225 Difference]: With dead ends: 1583 [2019-11-20 04:52:30,941 INFO L226 Difference]: Without dead ends: 1055 [2019-11-20 04:52:30,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-20 04:52:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-11-20 04:52:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-11-20 04:52:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-20 04:52:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-11-20 04:52:30,995 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-11-20 04:52:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:30,996 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-11-20 04:52:30,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-11-20 04:52:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 04:52:30,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:30,999 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2019-11-20 04:52:31,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:31,202 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-11-20 04:52:31,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:31,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641557284] [2019-11-20 04:52:31,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:31,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641557284] [2019-11-20 04:52:31,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:31,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:31,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045928565] [2019-11-20 04:52:31,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:31,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:31,270 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-11-20 04:52:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:31,499 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-11-20 04:52:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:31,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-20 04:52:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:31,506 INFO L225 Difference]: With dead ends: 2279 [2019-11-20 04:52:31,507 INFO L226 Difference]: Without dead ends: 1235 [2019-11-20 04:52:31,512 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-20 04:52:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-20 04:52:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-20 04:52:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-20 04:52:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-11-20 04:52:31,558 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-11-20 04:52:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:31,558 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-11-20 04:52:31,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-11-20 04:52:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:52:31,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:31,561 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:31,562 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:31,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-11-20 04:52:31,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:31,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353475442] [2019-11-20 04:52:31,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:52:31,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353475442] [2019-11-20 04:52:31,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:31,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:31,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873717169] [2019-11-20 04:52:31,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:31,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:31,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:31,605 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-11-20 04:52:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:31,812 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-11-20 04:52:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:31,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-20 04:52:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:31,819 INFO L225 Difference]: With dead ends: 2499 [2019-11-20 04:52:31,820 INFO L226 Difference]: Without dead ends: 1275 [2019-11-20 04:52:31,822 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-20 04:52:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-20 04:52:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-11-20 04:52:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-11-20 04:52:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-11-20 04:52:31,871 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-11-20 04:52:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:31,871 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-11-20 04:52:31,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-11-20 04:52:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 04:52:31,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:31,874 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:31,874 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-11-20 04:52:31,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:31,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368872463] [2019-11-20 04:52:31,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 04:52:31,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368872463] [2019-11-20 04:52:31,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:31,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:31,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323580387] [2019-11-20 04:52:31,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:31,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:31,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:31,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:31,927 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-11-20 04:52:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:32,115 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-11-20 04:52:32,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:32,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 04:52:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:32,124 INFO L225 Difference]: With dead ends: 2667 [2019-11-20 04:52:32,124 INFO L226 Difference]: Without dead ends: 1411 [2019-11-20 04:52:32,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-20 04:52:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-20 04:52:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-20 04:52:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 04:52:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-11-20 04:52:32,180 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-11-20 04:52:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:32,180 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-11-20 04:52:32,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-11-20 04:52:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 04:52:32,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:32,183 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 04:52:32,184 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-11-20 04:52:32,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:32,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844802270] [2019-11-20 04:52:32,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 04:52:32,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844802270] [2019-11-20 04:52:32,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:32,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:32,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643368773] [2019-11-20 04:52:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:32,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:32,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:32,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:32,226 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-11-20 04:52:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:32,432 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-11-20 04:52:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:32,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 04:52:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:32,441 INFO L225 Difference]: With dead ends: 2767 [2019-11-20 04:52:32,441 INFO L226 Difference]: Without dead ends: 1411 [2019-11-20 04:52:32,443 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-20 04:52:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-11-20 04:52:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-11-20 04:52:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 04:52:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-11-20 04:52:32,496 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-11-20 04:52:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:32,496 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-11-20 04:52:32,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-11-20 04:52:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 04:52:32,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:32,499 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 04:52:32,500 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-11-20 04:52:32,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:32,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426376190] [2019-11-20 04:52:32,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:32,513 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:32,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923649045] [2019-11-20 04:52:32,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:32,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:52:32,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 04:52:32,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426376190] [2019-11-20 04:52:32,638 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:32,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923649045] [2019-11-20 04:52:32,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:32,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:32,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183969269] [2019-11-20 04:52:32,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:32,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:32,640 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-11-20 04:52:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:32,877 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-11-20 04:52:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:32,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 04:52:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:32,887 INFO L225 Difference]: With dead ends: 2755 [2019-11-20 04:52:32,888 INFO L226 Difference]: Without dead ends: 1399 [2019-11-20 04:52:32,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-20 04:52:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-20 04:52:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-11-20 04:52:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-20 04:52:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-11-20 04:52:32,952 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-11-20 04:52:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:32,953 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-11-20 04:52:32,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-11-20 04:52:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 04:52:32,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:32,956 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 04:52:33,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:33,169 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-11-20 04:52:33,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:33,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506252712] [2019-11-20 04:52:33,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 04:52:33,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506252712] [2019-11-20 04:52:33,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:33,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:33,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389372400] [2019-11-20 04:52:33,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:33,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:33,209 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-11-20 04:52:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:33,433 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-11-20 04:52:33,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:33,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-20 04:52:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:33,442 INFO L225 Difference]: With dead ends: 2827 [2019-11-20 04:52:33,443 INFO L226 Difference]: Without dead ends: 1471 [2019-11-20 04:52:33,445 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-20 04:52:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-20 04:52:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-20 04:52:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-20 04:52:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-11-20 04:52:33,556 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-11-20 04:52:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:33,556 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-11-20 04:52:33,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-11-20 04:52:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 04:52:33,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:33,559 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 04:52:33,560 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-11-20 04:52:33,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:33,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186518423] [2019-11-20 04:52:33,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 04:52:33,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186518423] [2019-11-20 04:52:33,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:33,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:33,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465444378] [2019-11-20 04:52:33,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:33,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:33,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:33,595 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-11-20 04:52:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:33,800 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-11-20 04:52:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:33,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-20 04:52:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:33,810 INFO L225 Difference]: With dead ends: 2923 [2019-11-20 04:52:33,810 INFO L226 Difference]: Without dead ends: 1471 [2019-11-20 04:52:33,814 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-20 04:52:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-11-20 04:52:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-11-20 04:52:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-11-20 04:52:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-11-20 04:52:33,877 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-11-20 04:52:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:33,878 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-11-20 04:52:33,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-11-20 04:52:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 04:52:33,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:33,881 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2019-11-20 04:52:33,882 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-11-20 04:52:33,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:33,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612295673] [2019-11-20 04:52:33,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 04:52:33,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612295673] [2019-11-20 04:52:33,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:33,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:33,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234510439] [2019-11-20 04:52:33,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:33,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:33,930 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-11-20 04:52:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:34,135 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-11-20 04:52:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:34,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-20 04:52:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:34,145 INFO L225 Difference]: With dead ends: 3091 [2019-11-20 04:52:34,145 INFO L226 Difference]: Without dead ends: 1639 [2019-11-20 04:52:34,147 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-20 04:52:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-20 04:52:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-20 04:52:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-20 04:52:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-11-20 04:52:34,206 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-11-20 04:52:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:34,206 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-11-20 04:52:34,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-11-20 04:52:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 04:52:34,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:34,210 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 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-20 04:52:34,210 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-11-20 04:52:34,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:34,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839959814] [2019-11-20 04:52:34,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 04:52:34,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839959814] [2019-11-20 04:52:34,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:34,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:34,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792743050] [2019-11-20 04:52:34,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:34,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:34,266 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-11-20 04:52:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:34,501 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-11-20 04:52:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:34,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-20 04:52:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:34,510 INFO L225 Difference]: With dead ends: 3255 [2019-11-20 04:52:34,511 INFO L226 Difference]: Without dead ends: 1631 [2019-11-20 04:52:34,514 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-20 04:52:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-11-20 04:52:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-11-20 04:52:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-11-20 04:52:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-11-20 04:52:34,576 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-11-20 04:52:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:34,576 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-11-20 04:52:34,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-11-20 04:52:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 04:52:34,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:34,580 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 04:52:34,580 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-11-20 04:52:34,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:34,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036947986] [2019-11-20 04:52:34,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 04:52:34,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036947986] [2019-11-20 04:52:34,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:34,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:34,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315927130] [2019-11-20 04:52:34,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:34,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:34,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:34,626 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-11-20 04:52:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:34,823 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-11-20 04:52:34,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:34,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-20 04:52:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:34,832 INFO L225 Difference]: With dead ends: 3323 [2019-11-20 04:52:34,832 INFO L226 Difference]: Without dead ends: 1715 [2019-11-20 04:52:34,835 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-20 04:52:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-20 04:52:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-20 04:52:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-20 04:52:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-11-20 04:52:34,893 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-11-20 04:52:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:34,893 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-11-20 04:52:34,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-11-20 04:52:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 04:52:34,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:34,897 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-20 04:52:34,897 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-11-20 04:52:34,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490136538] [2019-11-20 04:52:34,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 04:52:34,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490136538] [2019-11-20 04:52:34,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:34,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:34,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151794948] [2019-11-20 04:52:34,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:34,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:34,941 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-11-20 04:52:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:35,119 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-11-20 04:52:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:35,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-20 04:52:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:35,129 INFO L225 Difference]: With dead ends: 3407 [2019-11-20 04:52:35,129 INFO L226 Difference]: Without dead ends: 1715 [2019-11-20 04:52:35,132 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-20 04:52:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-11-20 04:52:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-11-20 04:52:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-11-20 04:52:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-11-20 04:52:35,222 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-11-20 04:52:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:35,222 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-11-20 04:52:35,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-11-20 04:52:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 04:52:35,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:35,227 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-11-20 04:52:35,227 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-11-20 04:52:35,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:35,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205163359] [2019-11-20 04:52:35,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-11-20 04:52:35,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205163359] [2019-11-20 04:52:35,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:35,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:35,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017458110] [2019-11-20 04:52:35,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:35,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:35,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:35,275 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-11-20 04:52:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:35,333 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-11-20 04:52:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:35,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-20 04:52:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:35,350 INFO L225 Difference]: With dead ends: 3373 [2019-11-20 04:52:35,355 INFO L226 Difference]: Without dead ends: 1681 [2019-11-20 04:52:35,357 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-20 04:52:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-20 04:52:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-11-20 04:52:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-11-20 04:52:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-11-20 04:52:35,412 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-11-20 04:52:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:35,413 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-11-20 04:52:35,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-11-20 04:52:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 04:52:35,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:35,417 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-11-20 04:52:35,417 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-11-20 04:52:35,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:35,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90791735] [2019-11-20 04:52:35,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 04:52:35,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90791735] [2019-11-20 04:52:35,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988936364] [2019-11-20 04:52:35,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:35,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:52:35,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 04:52:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:52:35,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:52:35,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838004818] [2019-11-20 04:52:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:52:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:52:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:35,603 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-11-20 04:52:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:36,085 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-11-20 04:52:36,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:52:36,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-20 04:52:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:36,099 INFO L225 Difference]: With dead ends: 5291 [2019-11-20 04:52:36,099 INFO L226 Difference]: Without dead ends: 3521 [2019-11-20 04:52:36,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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-20 04:52:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-11-20 04:52:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-11-20 04:52:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-11-20 04:52:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-11-20 04:52:36,174 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-11-20 04:52:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:36,175 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-11-20 04:52:36,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:52:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-11-20 04:52:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 04:52:36,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:36,179 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-11-20 04:52:36,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:36,383 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-11-20 04:52:36,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:36,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824831075] [2019-11-20 04:52:36,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 04:52:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824831075] [2019-11-20 04:52:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579373803] [2019-11-20 04:52:36,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/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-20 04:52:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:36,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:52:36,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-20 04:52:36,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:52:36,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:52:36,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924757789] [2019-11-20 04:52:36,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:52:36,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:36,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:52:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:36,569 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-11-20 04:52:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:36,988 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-11-20 04:52:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:52:36,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 04:52:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:36,996 INFO L225 Difference]: With dead ends: 5632 [2019-11-20 04:52:36,997 INFO L226 Difference]: Without dead ends: 3574 [2019-11-20 04:52:37,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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-20 04:52:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-11-20 04:52:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2575. [2019-11-20 04:52:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-11-20 04:52:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3493 transitions. [2019-11-20 04:52:37,100 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3493 transitions. Word has length 156 [2019-11-20 04:52:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:37,101 INFO L462 AbstractCegarLoop]: Abstraction has 2575 states and 3493 transitions. [2019-11-20 04:52:37,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:52:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3493 transitions. [2019-11-20 04:52:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 04:52:37,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:37,108 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 04:52:37,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:37,312 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-11-20 04:52:37,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:37,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236193199] [2019-11-20 04:52:37,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 04:52:37,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236193199] [2019-11-20 04:52:37,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964898431] [2019-11-20 04:52:37,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:37,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:52:37,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-20 04:52:37,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:52:37,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:52:37,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31032043] [2019-11-20 04:52:37,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:52:37,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:52:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:37,476 INFO L87 Difference]: Start difference. First operand 2575 states and 3493 transitions. Second operand 4 states. [2019-11-20 04:52:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:37,874 INFO L93 Difference]: Finished difference Result 5967 states and 8033 transitions. [2019-11-20 04:52:37,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:52:37,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-20 04:52:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:37,881 INFO L225 Difference]: With dead ends: 5967 [2019-11-20 04:52:37,881 INFO L226 Difference]: Without dead ends: 3371 [2019-11-20 04:52:37,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-20 04:52:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2019-11-20 04:52:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2281. [2019-11-20 04:52:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-11-20 04:52:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3072 transitions. [2019-11-20 04:52:37,955 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3072 transitions. Word has length 163 [2019-11-20 04:52:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:37,956 INFO L462 AbstractCegarLoop]: Abstraction has 2281 states and 3072 transitions. [2019-11-20 04:52:37,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:52:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3072 transitions. [2019-11-20 04:52:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 04:52:37,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:37,961 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 04:52:38,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:38,170 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:38,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-11-20 04:52:38,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:38,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282836887] [2019-11-20 04:52:38,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 04:52:38,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282836887] [2019-11-20 04:52:38,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:38,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:38,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193774237] [2019-11-20 04:52:38,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:38,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:38,234 INFO L87 Difference]: Start difference. First operand 2281 states and 3072 transitions. Second operand 3 states. [2019-11-20 04:52:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:38,314 INFO L93 Difference]: Finished difference Result 5499 states and 7335 transitions. [2019-11-20 04:52:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:38,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-20 04:52:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:38,320 INFO L225 Difference]: With dead ends: 5499 [2019-11-20 04:52:38,320 INFO L226 Difference]: Without dead ends: 3225 [2019-11-20 04:52:38,323 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-20 04:52:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-11-20 04:52:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3221. [2019-11-20 04:52:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3221 states. [2019-11-20 04:52:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4261 transitions. [2019-11-20 04:52:38,415 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4261 transitions. Word has length 165 [2019-11-20 04:52:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:38,415 INFO L462 AbstractCegarLoop]: Abstraction has 3221 states and 4261 transitions. [2019-11-20 04:52:38,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4261 transitions. [2019-11-20 04:52:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 04:52:38,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:38,420 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-20 04:52:38,422 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-11-20 04:52:38,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:38,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190557002] [2019-11-20 04:52:38,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:38,440 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:38,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130508574] [2019-11-20 04:52:38,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:38,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 04:52:38,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:38,563 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-20 04:52:38,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190557002] [2019-11-20 04:52:38,564 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:38,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130508574] [2019-11-20 04:52:38,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:38,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:38,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815510178] [2019-11-20 04:52:38,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:52:38,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:52:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:38,566 INFO L87 Difference]: Start difference. First operand 3221 states and 4261 transitions. Second operand 4 states. [2019-11-20 04:52:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:38,803 INFO L93 Difference]: Finished difference Result 4906 states and 6379 transitions. [2019-11-20 04:52:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:52:38,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 04:52:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:38,810 INFO L225 Difference]: With dead ends: 4906 [2019-11-20 04:52:38,810 INFO L226 Difference]: Without dead ends: 4096 [2019-11-20 04:52:38,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2019-11-20 04:52:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3918. [2019-11-20 04:52:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3918 states. [2019-11-20 04:52:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5142 transitions. [2019-11-20 04:52:38,971 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5142 transitions. Word has length 186 [2019-11-20 04:52:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:38,971 INFO L462 AbstractCegarLoop]: Abstraction has 3918 states and 5142 transitions. [2019-11-20 04:52:38,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:52:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5142 transitions. [2019-11-20 04:52:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 04:52:38,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:38,977 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, 1, 1] [2019-11-20 04:52:39,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:39,187 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-11-20 04:52:39,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:39,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158419929] [2019-11-20 04:52:39,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:39,200 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:39,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370189835] [2019-11-20 04:52:39,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:39,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 04:52:39,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 04:52:39,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158419929] [2019-11-20 04:52:39,350 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:39,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370189835] [2019-11-20 04:52:39,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:39,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 04:52:39,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264076216] [2019-11-20 04:52:39,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:52:39,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:52:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:52:39,352 INFO L87 Difference]: Start difference. First operand 3918 states and 5142 transitions. Second operand 5 states. [2019-11-20 04:52:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:39,825 INFO L93 Difference]: Finished difference Result 5803 states and 7575 transitions. [2019-11-20 04:52:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:52:39,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-20 04:52:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:39,836 INFO L225 Difference]: With dead ends: 5803 [2019-11-20 04:52:39,837 INFO L226 Difference]: Without dead ends: 5802 [2019-11-20 04:52:39,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:52:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-11-20 04:52:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5243. [2019-11-20 04:52:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-11-20 04:52:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6898 transitions. [2019-11-20 04:52:40,007 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6898 transitions. Word has length 188 [2019-11-20 04:52:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:40,008 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 6898 transitions. [2019-11-20 04:52:40,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:52:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6898 transitions. [2019-11-20 04:52:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 04:52:40,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:40,013 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, 1, 1, 1] [2019-11-20 04:52:40,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:40,222 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-11-20 04:52:40,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:40,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507539335] [2019-11-20 04:52:40,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:40,234 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:40,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682658157] [2019-11-20 04:52:40,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:40,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:52:40,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:40,503 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2019-11-20 04:52:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-20 04:52:40,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507539335] [2019-11-20 04:52:40,540 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:40,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682658157] [2019-11-20 04:52:40,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:40,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:40,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860229613] [2019-11-20 04:52:40,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:52:40,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:40,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:52:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:40,542 INFO L87 Difference]: Start difference. First operand 5243 states and 6898 transitions. Second operand 4 states. [2019-11-20 04:52:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:41,042 INFO L93 Difference]: Finished difference Result 9754 states and 12848 transitions. [2019-11-20 04:52:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:52:41,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-20 04:52:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:41,052 INFO L225 Difference]: With dead ends: 9754 [2019-11-20 04:52:41,052 INFO L226 Difference]: Without dead ends: 5296 [2019-11-20 04:52:41,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-11-20 04:52:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5242. [2019-11-20 04:52:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2019-11-20 04:52:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6881 transitions. [2019-11-20 04:52:41,289 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6881 transitions. Word has length 189 [2019-11-20 04:52:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:41,290 INFO L462 AbstractCegarLoop]: Abstraction has 5242 states and 6881 transitions. [2019-11-20 04:52:41,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:52:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6881 transitions. [2019-11-20 04:52:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-20 04:52:41,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:41,296 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 04:52:41,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:41,502 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:41,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-11-20 04:52:41,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:41,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861123776] [2019-11-20 04:52:41,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:41,516 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 04:52:41,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049824615] [2019-11-20 04:52:41,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:41,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 04:52:41,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-20 04:52:41,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861123776] [2019-11-20 04:52:41,688 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 04:52:41,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049824615] [2019-11-20 04:52:41,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:41,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:41,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329317440] [2019-11-20 04:52:41,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:41,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:41,691 INFO L87 Difference]: Start difference. First operand 5242 states and 6881 transitions. Second operand 3 states. [2019-11-20 04:52:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:42,002 INFO L93 Difference]: Finished difference Result 10421 states and 13665 transitions. [2019-11-20 04:52:42,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:42,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-20 04:52:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:42,011 INFO L225 Difference]: With dead ends: 10421 [2019-11-20 04:52:42,011 INFO L226 Difference]: Without dead ends: 3596 [2019-11-20 04:52:42,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-20 04:52:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-11-20 04:52:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3587. [2019-11-20 04:52:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2019-11-20 04:52:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4675 transitions. [2019-11-20 04:52:42,134 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4675 transitions. Word has length 196 [2019-11-20 04:52:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:42,134 INFO L462 AbstractCegarLoop]: Abstraction has 3587 states and 4675 transitions. [2019-11-20 04:52:42,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4675 transitions. [2019-11-20 04:52:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-20 04:52:42,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:42,137 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 04:52:42,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:42,342 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-11-20 04:52:42,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:42,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982055712] [2019-11-20 04:52:42,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 04:52:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982055712] [2019-11-20 04:52:42,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:42,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:52:42,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898496546] [2019-11-20 04:52:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:42,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:42,405 INFO L87 Difference]: Start difference. First operand 3587 states and 4675 transitions. Second operand 3 states. [2019-11-20 04:52:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:42,635 INFO L93 Difference]: Finished difference Result 6826 states and 8875 transitions. [2019-11-20 04:52:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:42,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-20 04:52:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:42,644 INFO L225 Difference]: With dead ends: 6826 [2019-11-20 04:52:42,645 INFO L226 Difference]: Without dead ends: 3114 [2019-11-20 04:52:42,648 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-20 04:52:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2019-11-20 04:52:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3072. [2019-11-20 04:52:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-11-20 04:52:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3966 transitions. [2019-11-20 04:52:42,742 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3966 transitions. Word has length 197 [2019-11-20 04:52:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:42,743 INFO L462 AbstractCegarLoop]: Abstraction has 3072 states and 3966 transitions. [2019-11-20 04:52:42,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3966 transitions. [2019-11-20 04:52:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 04:52:42,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:42,747 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:52:42,747 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-11-20 04:52:42,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:42,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396437346] [2019-11-20 04:52:42,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-20 04:52:42,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396437346] [2019-11-20 04:52:42,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:42,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:42,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851057575] [2019-11-20 04:52:42,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:42,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:42,878 INFO L87 Difference]: Start difference. First operand 3072 states and 3966 transitions. Second operand 3 states. [2019-11-20 04:52:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:43,132 INFO L93 Difference]: Finished difference Result 6482 states and 8334 transitions. [2019-11-20 04:52:43,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:43,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-20 04:52:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:43,139 INFO L225 Difference]: With dead ends: 6482 [2019-11-20 04:52:43,140 INFO L226 Difference]: Without dead ends: 3432 [2019-11-20 04:52:43,144 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-20 04:52:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2019-11-20 04:52:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3412. [2019-11-20 04:52:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2019-11-20 04:52:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4356 transitions. [2019-11-20 04:52:43,252 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4356 transitions. Word has length 335 [2019-11-20 04:52:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:43,252 INFO L462 AbstractCegarLoop]: Abstraction has 3412 states and 4356 transitions. [2019-11-20 04:52:43,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4356 transitions. [2019-11-20 04:52:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-20 04:52:43,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:43,256 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:52:43,257 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-11-20 04:52:43,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:43,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574921936] [2019-11-20 04:52:43,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-20 04:52:43,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574921936] [2019-11-20 04:52:43,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:52:43,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 04:52:43,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555370243] [2019-11-20 04:52:43,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 04:52:43,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 04:52:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 04:52:43,470 INFO L87 Difference]: Start difference. First operand 3412 states and 4356 transitions. Second operand 3 states. [2019-11-20 04:52:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:43,714 INFO L93 Difference]: Finished difference Result 7182 states and 9154 transitions. [2019-11-20 04:52:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 04:52:43,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-20 04:52:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:43,723 INFO L225 Difference]: With dead ends: 7182 [2019-11-20 04:52:43,724 INFO L226 Difference]: Without dead ends: 3792 [2019-11-20 04:52:43,727 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-20 04:52:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2019-11-20 04:52:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3772. [2019-11-20 04:52:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3772 states. [2019-11-20 04:52:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4766 transitions. [2019-11-20 04:52:43,843 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4766 transitions. Word has length 366 [2019-11-20 04:52:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:43,844 INFO L462 AbstractCegarLoop]: Abstraction has 3772 states and 4766 transitions. [2019-11-20 04:52:43,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 04:52:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4766 transitions. [2019-11-20 04:52:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-20 04:52:43,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:52:43,848 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 04:52:43,849 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-20 04:52:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:52:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-11-20 04:52:43,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:52:43,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220878366] [2019-11-20 04:52:43,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:52:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 04:52:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220878366] [2019-11-20 04:52:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838865556] [2019-11-20 04:52:44,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:52:44,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 04:52:44,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:52:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-20 04:52:44,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:52:44,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 04:52:44,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665257462] [2019-11-20 04:52:44,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 04:52:44,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:52:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 04:52:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 04:52:44,272 INFO L87 Difference]: Start difference. First operand 3772 states and 4766 transitions. Second operand 4 states. [2019-11-20 04:52:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:52:44,478 INFO L93 Difference]: Finished difference Result 4931 states and 6242 transitions. [2019-11-20 04:52:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 04:52:44,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-20 04:52:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:52:44,479 INFO L225 Difference]: With dead ends: 4931 [2019-11-20 04:52:44,479 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:52:44,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 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-20 04:52:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:52:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:52:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:52:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:52:44,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-11-20 04:52:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:52:44,484 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:52:44,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 04:52:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:52:44,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:52:44,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:52:44,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:52:44,929 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2019-11-20 04:52:45,221 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-11-20 04:52:45,417 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 135 [2019-11-20 04:52:46,493 WARN L191 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 228 [2019-11-20 04:52:47,317 WARN L191 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 229 [2019-11-20 04:52:47,906 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-11-20 04:52:48,316 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-20 04:52:48,692 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2019-11-20 04:52:48,888 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 04:52:49,089 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 04:52:49,255 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 04:52:49,694 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 44 [2019-11-20 04:52:50,117 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 17 [2019-11-20 04:52:50,252 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 04:52:50,431 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-11-20 04:52:50,556 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 04:52:50,784 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-11-20 04:52:50,942 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-11-20 04:52:52,763 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 195 DAG size of output: 98 [2019-11-20 04:52:53,185 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-11-20 04:52:54,761 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 196 DAG size of output: 98 [2019-11-20 04:52:54,877 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 9 [2019-11-20 04:52:55,078 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-11-20 04:52:55,558 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2019-11-20 04:52:55,561 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-20 04:52:55,561 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-20 04:52:55,561 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-20 04:52:55,561 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-20 04:52:55,561 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-20 04:52:55,561 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-20 04:52:55,562 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-20 04:52:55,562 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-20 04:52:55,562 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 624) the Hoare annotation is: false [2019-11-20 04:52:55,562 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-20 04:52:55,562 INFO L444 ceAbstractionStarter]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,562 INFO L444 ceAbstractionStarter]: For program point L501(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,562 INFO L444 ceAbstractionStarter]: For program point L501-1(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,562 INFO L444 ceAbstractionStarter]: For program point L501-2(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L444 ceAbstractionStarter]: For program point L501-3(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-20 04:52:55,563 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 04:52:55,563 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 602) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-20 04:52:55,564 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (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 8192)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))))) (or (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))))) [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-20 04:52:55,564 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 04:52:55,565 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L447 ceAbstractionStarter]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-20 04:52:55,565 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-20 04:52:55,565 INFO L440 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8561)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L447 ceAbstractionStarter]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-20 04:52:55,566 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:52:55,567 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 611) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-20 04:52:55,567 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 623) the Hoare annotation is: false [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-20 04:52:55,567 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-20 04:52:55,568 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 04:52:55,569 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 609) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-20 04:52:55,569 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L440 ceAbstractionStarter]: At program point L550(lines 64 673) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 619) the Hoare annotation is: false [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L447 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-20 04:52:55,570 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-20 04:52:55,571 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-20 04:52:55,571 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-20 04:52:55,571 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-20 04:52:55,571 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:52:55,571 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,571 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse1 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (.cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse0) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (and .cse1 .cse0))) [2019-11-20 04:52:55,571 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 607) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8561)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,572 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 617) 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 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.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 8195))) (.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 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-20 04:52:55,572 INFO L440 ceAbstractionStarter]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse19 (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse21 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse22 .cse4 .cse8 .cse23 .cse9 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse11 .cse12)) (.cse18 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse13 .cse14 .cse15 .cse11) (and .cse16 .cse6 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse16 .cse17 .cse6 .cse13 .cse11 .cse18) (and .cse6 .cse13 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11) (and .cse5 .cse19) (and .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse18) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21 .cse22 .cse23) .cse16) (and .cse0 .cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse15) (and .cse19 .cse18)))) [2019-11-20 04:52:55,572 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-20 04:52:55,572 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-20 04:52:55,572 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-20 04:52:55,572 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 501) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-20 04:52:55,573 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-20 04:52:55,576 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-20 04:52:55,576 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-20 04:52:55,576 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:52:55,577 INFO L447 ceAbstractionStarter]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-20 04:52:55,577 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-11-20 04:52:55,577 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-20 04:52:55,577 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-20 04:52:55,577 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-20 04:52:55,577 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-20 04:52:55,578 INFO L444 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-20 04:52:55,578 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-20 04:52:55,578 INFO L444 ceAbstractionStarter]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-11-20 04:52:55,578 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (and .cse2 (and .cse1 .cse3 .cse4 .cse5 .cse6)) .cse7)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse6))) [2019-11-20 04:52:55,578 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 605) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8545)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,579 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,579 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-20 04:52:55,579 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-20 04:52:55,579 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-20 04:52:55,579 INFO L444 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-20 04:52:55,579 INFO L444 ceAbstractionStarter]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-20 04:52:55,580 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-20 04:52:55,580 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-20 04:52:55,580 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-20 04:52:55,580 INFO L444 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-20 04:52:55,580 INFO L444 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-20 04:52:55,580 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-20 04:52:55,581 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-20 04:52:55,581 INFO L440 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,581 INFO L444 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-20 04:52:55,581 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-20 04:52:55,581 INFO L444 ceAbstractionStarter]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-11-20 04:52:55,582 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-20 04:52:55,582 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-20 04:52:55,582 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-20 04:52:55,582 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (let ((.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse17 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse16 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse19 (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 .cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse7 .cse21 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) .cse3 .cse22 .cse4 .cse8 .cse23 .cse9 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse11 .cse12)) (.cse18 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse13 .cse14 .cse15 .cse11) (and .cse16 .cse6 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse16 .cse17 .cse6 .cse13 .cse11 .cse18) (and .cse6 .cse13 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11) (and .cse5 .cse19) (and .cse16 .cse17 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse18) (and (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21 .cse22 .cse23) .cse16) (and .cse0 .cse14 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse15) (and .cse19 .cse18)))) [2019-11-20 04:52:55,583 INFO L440 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (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 8561)) (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 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 04:52:55,583 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2) (and .cse3 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse3 .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2))) [2019-11-20 04:52:55,583 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.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 8192))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (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 8195))) (.cse16 (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 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-11-20 04:52:55,584 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 04:52:55,584 INFO L444 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-20 04:52:55,584 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-20 04:52:55,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:52:55 BoogieIcfgContainer [2019-11-20 04:52:55,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:52:55,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:52:55,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:52:55,631 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:52:55,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:52:26" (3/4) ... [2019-11-20 04:52:55,635 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:52:55,656 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 04:52:55,657 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 04:52:55,767 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9030d7f0-55a8-42cd-8ccd-202b15328d9d/bin/uautomizer/witness.graphml [2019-11-20 04:52:55,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:52:55,769 INFO L168 Benchmark]: Toolchain (without parser) took 30671.50 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 807.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 608.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:52:55,769 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:52:55,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:52:55,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:52:55,770 INFO L168 Benchmark]: Boogie Preprocessor took 35.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:52:55,771 INFO L168 Benchmark]: RCFGBuilder took 787.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:52:55,771 INFO L168 Benchmark]: TraceAbstraction took 29151.21 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 681.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -128.4 MB). Peak memory consumption was 948.7 MB. Max. memory is 11.5 GB. [2019-11-20 04:52:55,771 INFO L168 Benchmark]: Witness Printer took 137.00 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:52:55,774 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 787.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29151.21 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 681.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -128.4 MB). Peak memory consumption was 948.7 MB. Max. memory is 11.5 GB. * Witness Printer took 137.00 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 501]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((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 == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((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 == 8576)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195)) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(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 == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((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 == 8192)) && !(s__state == 8496)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(s__state == 8576))) || (((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 16384)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && s__state <= 8640) && 8576 <= s__state) || (((blastFlag <= 2 && s__state <= 8640) && 8576 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((!(s__state == 8192) && s__state <= 8448) && !(s__state == 8448)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8195))) || (!(s__state == 8576) && (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8576)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8192)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((blastFlag <= 2 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && !(s__state == 8192)) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8195))) || (((((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || ((((!(s__state == 8192) && s__state <= 8448) && !(s__state == 8448)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8195))) || (!(s__state == 8576) && (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((8672 <= s__state && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && blastFlag <= 3)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit)) || (blastFlag <= 3 && (s__s3__tmp__next_state___0 <= 8640 && 8576 <= s__state && (((!(s__state == 8672) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 16384)) && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 29.0s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.8s, HoareTripleCheckerStatistics: 6988 SDtfs, 5871 SDslu, 3536 SDs, 0 SdLazy, 4214 SolverSat, 1138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1935 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5243occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 4793 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 275 NumberOfFragments, 1948 HoareAnnotationTreeSize, 29 FomulaSimplifications, 223086 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 46520 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1668610 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3550 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 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...