./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49452e318e3c9c4b1e038ab7778998d33b04e5b2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:54:33,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:54:33,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:54:33,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:54:33,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:54:33,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:54:33,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:54:33,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:54:33,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:54:33,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:54:33,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:54:33,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:54:33,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:54:33,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:54:33,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:54:33,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:54:33,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:54:33,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:54:33,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:54:33,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:54:33,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:54:33,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:54:33,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:54:33,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:54:33,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:54:33,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:54:33,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:54:33,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:54:33,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:54:33,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:54:33,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:54:33,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:54:33,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:54:33,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:54:33,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:54:33,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:54:33,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:54:33,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:54:33,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:54:33,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:54:33,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:54:33,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 02:54:33,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:54:33,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:54:33,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:54:33,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:54:33,678 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:54:33,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:54:33,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:54:33,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:54:33,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:54:33,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:54:33,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:54:33,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:54:33,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:54:33,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:54:33,680 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:54:33,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:54:33,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:54:33,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:54:33,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:54:33,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:54:33,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:54:33,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:54:33,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:54:33,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:33,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:54:33,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:54:33,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:54:33,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:54:33,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:54:33,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:54:33,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-28 02:54:33,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:54:34,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:54:34,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:54:34,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:54:34,020 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:54:34,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-28 02:54:34,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a805acca/d9a39e3c6e2c49afaaf3f8b682ea5bd4/FLAG7d35c361e [2019-11-28 02:54:34,573 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:54:34,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-28 02:54:34,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a805acca/d9a39e3c6e2c49afaaf3f8b682ea5bd4/FLAG7d35c361e [2019-11-28 02:54:34,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a805acca/d9a39e3c6e2c49afaaf3f8b682ea5bd4 [2019-11-28 02:54:34,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:54:34,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:54:34,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:34,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:54:34,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:54:34,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:34" (1/1) ... [2019-11-28 02:54:34,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a190206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:34, skipping insertion in model container [2019-11-28 02:54:34,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:54:34" (1/1) ... [2019-11-28 02:54:34,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:54:35,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:54:35,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:35,427 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:54:35,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:54:35,504 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:54:35,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35 WrapperNode [2019-11-28 02:54:35,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:54:35,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:35,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:54:35,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:54:35,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:54:35,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:54:35,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:54:35,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:54:35,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... [2019-11-28 02:54:35,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:54:35,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:54:35,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:54:35,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:54:35,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:54:35,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:54:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:54:35,814 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 02:54:36,511 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 02:54:36,511 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 02:54:36,514 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:54:36,515 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 02:54:36,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:36 BoogieIcfgContainer [2019-11-28 02:54:36,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:54:36,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:54:36,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:54:36,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:54:36,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:54:34" (1/3) ... [2019-11-28 02:54:36,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b89e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:36, skipping insertion in model container [2019-11-28 02:54:36,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:54:35" (2/3) ... [2019-11-28 02:54:36,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b89e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:54:36, skipping insertion in model container [2019-11-28 02:54:36,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:36" (3/3) ... [2019-11-28 02:54:36,523 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-28 02:54:36,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:54:36,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 02:54:36,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 02:54:36,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:54:36,579 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:54:36,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:54:36,581 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:54:36,581 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:54:36,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:54:36,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:54:36,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:54:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-28 02:54:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:54:36,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:36,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:36,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1272360941, now seen corresponding path program 1 times [2019-11-28 02:54:36,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:36,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263016985] [2019-11-28 02:54:36,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:36,800 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-28 02:54:36,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263016985] [2019-11-28 02:54:36,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:36,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:36,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803736443] [2019-11-28 02:54:36,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:36,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:36,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:36,827 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-11-28 02:54:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:37,124 INFO L93 Difference]: Finished difference Result 311 states and 519 transitions. [2019-11-28 02:54:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:37,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:54:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:37,146 INFO L225 Difference]: With dead ends: 311 [2019-11-28 02:54:37,146 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 02:54:37,151 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-28 02:54:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 02:54:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-28 02:54:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 02:54:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-28 02:54:37,200 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 17 [2019-11-28 02:54:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:37,201 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-28 02:54:37,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-28 02:54:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:54:37,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:37,203 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-28 02:54:37,203 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1039871977, now seen corresponding path program 1 times [2019-11-28 02:54:37,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:37,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066478460] [2019-11-28 02:54:37,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:37,260 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-28 02:54:37,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066478460] [2019-11-28 02:54:37,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:37,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:37,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867691203] [2019-11-28 02:54:37,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:37,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:37,269 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 3 states. [2019-11-28 02:54:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:37,486 INFO L93 Difference]: Finished difference Result 301 states and 450 transitions. [2019-11-28 02:54:37,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:37,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:54:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:37,492 INFO L225 Difference]: With dead ends: 301 [2019-11-28 02:54:37,493 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 02:54:37,497 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-28 02:54:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 02:54:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2019-11-28 02:54:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 02:54:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2019-11-28 02:54:37,528 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2019-11-28 02:54:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:37,529 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2019-11-28 02:54:37,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2019-11-28 02:54:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:54:37,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:37,532 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-28 02:54:37,532 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1005531851, now seen corresponding path program 1 times [2019-11-28 02:54:37,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:37,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515001802] [2019-11-28 02:54:37,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:37,617 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-28 02:54:37,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515001802] [2019-11-28 02:54:37,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:37,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:37,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508447830] [2019-11-28 02:54:37,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:37,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:37,620 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand 3 states. [2019-11-28 02:54:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:37,782 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2019-11-28 02:54:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:37,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:54:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:37,785 INFO L225 Difference]: With dead ends: 303 [2019-11-28 02:54:37,785 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 02:54:37,786 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-28 02:54:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 02:54:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-11-28 02:54:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 02:54:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2019-11-28 02:54:37,801 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2019-11-28 02:54:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:37,802 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2019-11-28 02:54:37,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2019-11-28 02:54:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:54:37,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:37,803 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-28 02:54:37,804 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash -994026446, now seen corresponding path program 1 times [2019-11-28 02:54:37,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:37,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962021526] [2019-11-28 02:54:37,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:37,859 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-28 02:54:37,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962021526] [2019-11-28 02:54:37,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:37,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:37,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050277888] [2019-11-28 02:54:37,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:37,863 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand 3 states. [2019-11-28 02:54:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:38,011 INFO L93 Difference]: Finished difference Result 305 states and 454 transitions. [2019-11-28 02:54:38,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:38,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:54:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:38,013 INFO L225 Difference]: With dead ends: 305 [2019-11-28 02:54:38,013 INFO L226 Difference]: Without dead ends: 161 [2019-11-28 02:54:38,014 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-28 02:54:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-28 02:54:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2019-11-28 02:54:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 02:54:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-11-28 02:54:38,038 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2019-11-28 02:54:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:38,038 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-11-28 02:54:38,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-11-28 02:54:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:54:38,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:38,040 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] [2019-11-28 02:54:38,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash 461608262, now seen corresponding path program 1 times [2019-11-28 02:54:38,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:38,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276847855] [2019-11-28 02:54:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:38,111 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-28 02:54:38,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276847855] [2019-11-28 02:54:38,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:38,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:38,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723168032] [2019-11-28 02:54:38,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:38,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:38,115 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 3 states. [2019-11-28 02:54:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:38,264 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-11-28 02:54:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:38,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:54:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:38,267 INFO L225 Difference]: With dead ends: 307 [2019-11-28 02:54:38,268 INFO L226 Difference]: Without dead ends: 162 [2019-11-28 02:54:38,269 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-28 02:54:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-28 02:54:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2019-11-28 02:54:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 02:54:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2019-11-28 02:54:38,287 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2019-11-28 02:54:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:38,288 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2019-11-28 02:54:38,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2019-11-28 02:54:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 02:54:38,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:38,295 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, 1, 1] [2019-11-28 02:54:38,295 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 205704618, now seen corresponding path program 1 times [2019-11-28 02:54:38,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:38,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911991923] [2019-11-28 02:54:38,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:38,401 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-28 02:54:38,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911991923] [2019-11-28 02:54:38,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:38,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:38,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694148935] [2019-11-28 02:54:38,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:38,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:38,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:38,404 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand 3 states. [2019-11-28 02:54:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:38,570 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-28 02:54:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:38,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-28 02:54:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:38,572 INFO L225 Difference]: With dead ends: 330 [2019-11-28 02:54:38,572 INFO L226 Difference]: Without dead ends: 184 [2019-11-28 02:54:38,573 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-28 02:54:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-28 02:54:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-28 02:54:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 02:54:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-11-28 02:54:38,582 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 46 [2019-11-28 02:54:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:38,583 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-11-28 02:54:38,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-11-28 02:54:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 02:54:38,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:38,585 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, 1, 1] [2019-11-28 02:54:38,585 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2094953876, now seen corresponding path program 1 times [2019-11-28 02:54:38,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:38,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621020655] [2019-11-28 02:54:38,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:38,642 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-28 02:54:38,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621020655] [2019-11-28 02:54:38,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:38,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:38,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951623914] [2019-11-28 02:54:38,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:38,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:38,652 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 3 states. [2019-11-28 02:54:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:38,777 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2019-11-28 02:54:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:38,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-28 02:54:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:38,781 INFO L225 Difference]: With dead ends: 379 [2019-11-28 02:54:38,781 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 02:54:38,782 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-28 02:54:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 02:54:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-11-28 02:54:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 02:54:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2019-11-28 02:54:38,796 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 58 [2019-11-28 02:54:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:38,799 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2019-11-28 02:54:38,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2019-11-28 02:54:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 02:54:38,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:38,805 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, 1, 1] [2019-11-28 02:54:38,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2134557448, now seen corresponding path program 1 times [2019-11-28 02:54:38,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:38,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106088802] [2019-11-28 02:54:38,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:38,862 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-28 02:54:38,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106088802] [2019-11-28 02:54:38,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:38,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:38,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239018265] [2019-11-28 02:54:38,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:38,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:38,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:38,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:38,866 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2019-11-28 02:54:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:39,020 INFO L93 Difference]: Finished difference Result 396 states and 595 transitions. [2019-11-28 02:54:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:39,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-28 02:54:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:39,023 INFO L225 Difference]: With dead ends: 396 [2019-11-28 02:54:39,023 INFO L226 Difference]: Without dead ends: 203 [2019-11-28 02:54:39,024 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-28 02:54:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-28 02:54:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-11-28 02:54:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 02:54:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 301 transitions. [2019-11-28 02:54:39,038 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 301 transitions. Word has length 59 [2019-11-28 02:54:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:39,039 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 301 transitions. [2019-11-28 02:54:39,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 301 transitions. [2019-11-28 02:54:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 02:54:39,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:39,040 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, 1, 1] [2019-11-28 02:54:39,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1607957135, now seen corresponding path program 1 times [2019-11-28 02:54:39,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:39,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627848775] [2019-11-28 02:54:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:39,116 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-28 02:54:39,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627848775] [2019-11-28 02:54:39,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:39,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:39,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114290717] [2019-11-28 02:54:39,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:39,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:39,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:39,122 INFO L87 Difference]: Start difference. First operand 201 states and 301 transitions. Second operand 3 states. [2019-11-28 02:54:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:39,257 INFO L93 Difference]: Finished difference Result 439 states and 666 transitions. [2019-11-28 02:54:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:39,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 02:54:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:39,259 INFO L225 Difference]: With dead ends: 439 [2019-11-28 02:54:39,260 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 02:54:39,260 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-28 02:54:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 02:54:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2019-11-28 02:54:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-28 02:54:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 372 transitions. [2019-11-28 02:54:39,274 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 372 transitions. Word has length 72 [2019-11-28 02:54:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:39,275 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 372 transitions. [2019-11-28 02:54:39,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 372 transitions. [2019-11-28 02:54:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 02:54:39,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:39,278 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, 1, 1] [2019-11-28 02:54:39,283 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:39,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1882884773, now seen corresponding path program 1 times [2019-11-28 02:54:39,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:39,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604151455] [2019-11-28 02:54:39,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:39,347 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-28 02:54:39,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604151455] [2019-11-28 02:54:39,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:39,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:39,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367452187] [2019-11-28 02:54:39,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:39,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:39,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:39,350 INFO L87 Difference]: Start difference. First operand 243 states and 372 transitions. Second operand 3 states. [2019-11-28 02:54:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:39,513 INFO L93 Difference]: Finished difference Result 513 states and 788 transitions. [2019-11-28 02:54:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:39,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 02:54:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:39,516 INFO L225 Difference]: With dead ends: 513 [2019-11-28 02:54:39,516 INFO L226 Difference]: Without dead ends: 277 [2019-11-28 02:54:39,517 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-28 02:54:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-28 02:54:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 270. [2019-11-28 02:54:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-28 02:54:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 412 transitions. [2019-11-28 02:54:39,529 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 412 transitions. Word has length 73 [2019-11-28 02:54:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:39,530 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 412 transitions. [2019-11-28 02:54:39,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 412 transitions. [2019-11-28 02:54:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 02:54:39,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:39,532 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, 1, 1] [2019-11-28 02:54:39,532 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash -369256571, now seen corresponding path program 1 times [2019-11-28 02:54:39,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:39,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362299025] [2019-11-28 02:54:39,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:39,566 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-28 02:54:39,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362299025] [2019-11-28 02:54:39,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:39,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:39,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303261034] [2019-11-28 02:54:39,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:39,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:39,568 INFO L87 Difference]: Start difference. First operand 270 states and 412 transitions. Second operand 3 states. [2019-11-28 02:54:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:39,717 INFO L93 Difference]: Finished difference Result 536 states and 817 transitions. [2019-11-28 02:54:39,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:39,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 02:54:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:39,720 INFO L225 Difference]: With dead ends: 536 [2019-11-28 02:54:39,720 INFO L226 Difference]: Without dead ends: 273 [2019-11-28 02:54:39,721 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-28 02:54:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-28 02:54:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-11-28 02:54:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 02:54:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-11-28 02:54:39,732 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 73 [2019-11-28 02:54:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:39,732 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-11-28 02:54:39,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-11-28 02:54:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 02:54:39,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:39,734 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, 1, 1] [2019-11-28 02:54:39,734 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash -189803919, now seen corresponding path program 1 times [2019-11-28 02:54:39,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:39,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032958151] [2019-11-28 02:54:39,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:39,776 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-28 02:54:39,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032958151] [2019-11-28 02:54:39,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:39,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:39,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296845826] [2019-11-28 02:54:39,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:39,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:39,779 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-11-28 02:54:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:39,929 INFO L93 Difference]: Finished difference Result 542 states and 825 transitions. [2019-11-28 02:54:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:39,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 02:54:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:39,931 INFO L225 Difference]: With dead ends: 542 [2019-11-28 02:54:39,932 INFO L226 Difference]: Without dead ends: 278 [2019-11-28 02:54:39,934 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-28 02:54:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-28 02:54:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2019-11-28 02:54:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 02:54:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2019-11-28 02:54:39,945 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 74 [2019-11-28 02:54:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:39,946 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2019-11-28 02:54:39,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-11-28 02:54:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 02:54:39,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:39,948 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, 1, 1] [2019-11-28 02:54:39,948 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash 873313086, now seen corresponding path program 1 times [2019-11-28 02:54:39,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:39,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648041374] [2019-11-28 02:54:39,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:40,006 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-28 02:54:40,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648041374] [2019-11-28 02:54:40,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:40,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:40,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077636242] [2019-11-28 02:54:40,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:40,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:40,010 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 3 states. [2019-11-28 02:54:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:40,185 INFO L93 Difference]: Finished difference Result 582 states and 881 transitions. [2019-11-28 02:54:40,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:40,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-28 02:54:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:40,188 INFO L225 Difference]: With dead ends: 582 [2019-11-28 02:54:40,188 INFO L226 Difference]: Without dead ends: 318 [2019-11-28 02:54:40,189 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-28 02:54:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-28 02:54:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-11-28 02:54:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-28 02:54:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 478 transitions. [2019-11-28 02:54:40,202 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 478 transitions. Word has length 89 [2019-11-28 02:54:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:40,202 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 478 transitions. [2019-11-28 02:54:40,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 478 transitions. [2019-11-28 02:54:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 02:54:40,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:40,204 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, 1, 1, 1] [2019-11-28 02:54:40,205 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:40,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1282770437, now seen corresponding path program 1 times [2019-11-28 02:54:40,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:40,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655563976] [2019-11-28 02:54:40,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:40,244 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-28 02:54:40,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655563976] [2019-11-28 02:54:40,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:40,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:40,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026119169] [2019-11-28 02:54:40,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:40,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:40,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:40,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:40,247 INFO L87 Difference]: Start difference. First operand 314 states and 478 transitions. Second operand 3 states. [2019-11-28 02:54:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:40,399 INFO L93 Difference]: Finished difference Result 637 states and 972 transitions. [2019-11-28 02:54:40,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:40,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-28 02:54:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:40,402 INFO L225 Difference]: With dead ends: 637 [2019-11-28 02:54:40,402 INFO L226 Difference]: Without dead ends: 328 [2019-11-28 02:54:40,403 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-28 02:54:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-28 02:54:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-11-28 02:54:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-28 02:54:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 497 transitions. [2019-11-28 02:54:40,415 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 497 transitions. Word has length 90 [2019-11-28 02:54:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:40,416 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 497 transitions. [2019-11-28 02:54:40,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 497 transitions. [2019-11-28 02:54:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 02:54:40,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:40,418 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, 1, 1] [2019-11-28 02:54:40,418 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 630357241, now seen corresponding path program 1 times [2019-11-28 02:54:40,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:40,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431645850] [2019-11-28 02:54:40,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:40,464 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-28 02:54:40,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431645850] [2019-11-28 02:54:40,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:40,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:40,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146702874] [2019-11-28 02:54:40,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:40,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:40,468 INFO L87 Difference]: Start difference. First operand 324 states and 497 transitions. Second operand 3 states. [2019-11-28 02:54:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:40,629 INFO L93 Difference]: Finished difference Result 678 states and 1042 transitions. [2019-11-28 02:54:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:40,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 02:54:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:40,632 INFO L225 Difference]: With dead ends: 678 [2019-11-28 02:54:40,632 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 02:54:40,633 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-28 02:54:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 02:54:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-28 02:54:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-28 02:54:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2019-11-28 02:54:40,649 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 99 [2019-11-28 02:54:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:40,649 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2019-11-28 02:54:40,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2019-11-28 02:54:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 02:54:40,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:40,652 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, 1, 1] [2019-11-28 02:54:40,652 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 757835045, now seen corresponding path program 1 times [2019-11-28 02:54:40,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118524904] [2019-11-28 02:54:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:40,695 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-28 02:54:40,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118524904] [2019-11-28 02:54:40,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:40,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:40,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671461443] [2019-11-28 02:54:40,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:40,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:40,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:40,700 INFO L87 Difference]: Start difference. First operand 349 states and 531 transitions. Second operand 3 states. [2019-11-28 02:54:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:40,872 INFO L93 Difference]: Finished difference Result 703 states and 1071 transitions. [2019-11-28 02:54:40,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:40,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 02:54:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:40,874 INFO L225 Difference]: With dead ends: 703 [2019-11-28 02:54:40,875 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 02:54:40,876 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-28 02:54:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 02:54:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 349. [2019-11-28 02:54:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-28 02:54:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 526 transitions. [2019-11-28 02:54:40,892 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 526 transitions. Word has length 100 [2019-11-28 02:54:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:40,892 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 526 transitions. [2019-11-28 02:54:40,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 526 transitions. [2019-11-28 02:54:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 02:54:40,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:40,894 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, 1, 1] [2019-11-28 02:54:40,895 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash -927735321, now seen corresponding path program 1 times [2019-11-28 02:54:40,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:40,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677777652] [2019-11-28 02:54:40,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:40,941 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-28 02:54:40,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677777652] [2019-11-28 02:54:40,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:40,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:40,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980991526] [2019-11-28 02:54:40,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:40,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:40,943 INFO L87 Difference]: Start difference. First operand 349 states and 526 transitions. Second operand 3 states. [2019-11-28 02:54:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:41,079 INFO L93 Difference]: Finished difference Result 718 states and 1081 transitions. [2019-11-28 02:54:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:41,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-28 02:54:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:41,082 INFO L225 Difference]: With dead ends: 718 [2019-11-28 02:54:41,082 INFO L226 Difference]: Without dead ends: 376 [2019-11-28 02:54:41,083 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-28 02:54:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-28 02:54:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-28 02:54:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-28 02:54:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 556 transitions. [2019-11-28 02:54:41,096 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 556 transitions. Word has length 119 [2019-11-28 02:54:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:41,096 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 556 transitions. [2019-11-28 02:54:41,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 556 transitions. [2019-11-28 02:54:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 02:54:41,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:41,098 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, 1, 1] [2019-11-28 02:54:41,098 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1207090035, now seen corresponding path program 1 times [2019-11-28 02:54:41,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:41,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82417821] [2019-11-28 02:54:41,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:41,134 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-28 02:54:41,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82417821] [2019-11-28 02:54:41,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:41,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:41,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358660840] [2019-11-28 02:54:41,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:41,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:41,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:41,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:41,139 INFO L87 Difference]: Start difference. First operand 373 states and 556 transitions. Second operand 3 states. [2019-11-28 02:54:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:41,283 INFO L93 Difference]: Finished difference Result 742 states and 1105 transitions. [2019-11-28 02:54:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:41,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 02:54:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:41,286 INFO L225 Difference]: With dead ends: 742 [2019-11-28 02:54:41,286 INFO L226 Difference]: Without dead ends: 376 [2019-11-28 02:54:41,287 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-28 02:54:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-28 02:54:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2019-11-28 02:54:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-28 02:54:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2019-11-28 02:54:41,303 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 120 [2019-11-28 02:54:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:41,303 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2019-11-28 02:54:41,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2019-11-28 02:54:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 02:54:41,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:41,306 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, 1, 1, 1] [2019-11-28 02:54:41,306 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash -568364771, now seen corresponding path program 1 times [2019-11-28 02:54:41,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:41,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676004224] [2019-11-28 02:54:41,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:41,356 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-28 02:54:41,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676004224] [2019-11-28 02:54:41,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:41,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:41,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811718135] [2019-11-28 02:54:41,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:41,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:41,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:41,359 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand 3 states. [2019-11-28 02:54:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:41,530 INFO L93 Difference]: Finished difference Result 784 states and 1155 transitions. [2019-11-28 02:54:41,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:41,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-28 02:54:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:41,533 INFO L225 Difference]: With dead ends: 784 [2019-11-28 02:54:41,533 INFO L226 Difference]: Without dead ends: 418 [2019-11-28 02:54:41,534 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-28 02:54:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-28 02:54:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2019-11-28 02:54:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-28 02:54:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 609 transitions. [2019-11-28 02:54:41,549 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 609 transitions. Word has length 129 [2019-11-28 02:54:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:41,549 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 609 transitions. [2019-11-28 02:54:41,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 609 transitions. [2019-11-28 02:54:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 02:54:41,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:41,551 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, 1, 1, 1] [2019-11-28 02:54:41,551 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash 12959108, now seen corresponding path program 1 times [2019-11-28 02:54:41,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:41,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993130488] [2019-11-28 02:54:41,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:41,605 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-28 02:54:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993130488] [2019-11-28 02:54:41,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155778512] [2019-11-28 02:54:41,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:41,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:41,607 INFO L87 Difference]: Start difference. First operand 414 states and 609 transitions. Second operand 3 states. [2019-11-28 02:54:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:41,767 INFO L93 Difference]: Finished difference Result 825 states and 1212 transitions. [2019-11-28 02:54:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:41,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-28 02:54:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:41,770 INFO L225 Difference]: With dead ends: 825 [2019-11-28 02:54:41,770 INFO L226 Difference]: Without dead ends: 416 [2019-11-28 02:54:41,771 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-28 02:54:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-28 02:54:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2019-11-28 02:54:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-28 02:54:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2019-11-28 02:54:41,786 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 130 [2019-11-28 02:54:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:41,786 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2019-11-28 02:54:41,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2019-11-28 02:54:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-28 02:54:41,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:41,788 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, 1, 1] [2019-11-28 02:54:41,788 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash -637521445, now seen corresponding path program 1 times [2019-11-28 02:54:41,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:41,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756980373] [2019-11-28 02:54:41,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:41,833 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-28 02:54:41,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756980373] [2019-11-28 02:54:41,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:41,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:41,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107297190] [2019-11-28 02:54:41,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:41,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:41,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:41,836 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand 3 states. [2019-11-28 02:54:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:41,958 INFO L93 Difference]: Finished difference Result 842 states and 1234 transitions. [2019-11-28 02:54:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:41,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-28 02:54:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:41,961 INFO L225 Difference]: With dead ends: 842 [2019-11-28 02:54:41,961 INFO L226 Difference]: Without dead ends: 437 [2019-11-28 02:54:41,962 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-28 02:54:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-28 02:54:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-28 02:54:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 02:54:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2019-11-28 02:54:41,978 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 140 [2019-11-28 02:54:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:41,978 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2019-11-28 02:54:41,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2019-11-28 02:54:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 02:54:41,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:41,980 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, 1, 1] [2019-11-28 02:54:41,981 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 871119983, now seen corresponding path program 1 times [2019-11-28 02:54:41,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:41,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598094046] [2019-11-28 02:54:41,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,021 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-28 02:54:42,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598094046] [2019-11-28 02:54:42,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:42,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887068836] [2019-11-28 02:54:42,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:42,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:42,023 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand 3 states. [2019-11-28 02:54:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,168 INFO L93 Difference]: Finished difference Result 863 states and 1249 transitions. [2019-11-28 02:54:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:42,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-28 02:54:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,171 INFO L225 Difference]: With dead ends: 863 [2019-11-28 02:54:42,171 INFO L226 Difference]: Without dead ends: 437 [2019-11-28 02:54:42,172 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-28 02:54:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-28 02:54:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2019-11-28 02:54:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 02:54:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-28 02:54:42,193 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 141 [2019-11-28 02:54:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,194 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-28 02:54:42,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-28 02:54:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 02:54:42,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,196 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, 1, 1] [2019-11-28 02:54:42,197 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1128117336, now seen corresponding path program 1 times [2019-11-28 02:54:42,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106502592] [2019-11-28 02:54:42,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-28 02:54:42,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106502592] [2019-11-28 02:54:42,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:42,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:42,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773976758] [2019-11-28 02:54:42,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:42,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:42,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:42,261 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-28 02:54:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,305 INFO L93 Difference]: Finished difference Result 1279 states and 1823 transitions. [2019-11-28 02:54:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:42,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 02:54:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,310 INFO L225 Difference]: With dead ends: 1279 [2019-11-28 02:54:42,310 INFO L226 Difference]: Without dead ends: 853 [2019-11-28 02:54:42,312 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-28 02:54:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-28 02:54:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 434. [2019-11-28 02:54:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-28 02:54:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2019-11-28 02:54:42,337 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 156 [2019-11-28 02:54:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,337 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2019-11-28 02:54:42,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2019-11-28 02:54:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 02:54:42,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,340 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, 1, 1] [2019-11-28 02:54:42,340 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash 386659640, now seen corresponding path program 1 times [2019-11-28 02:54:42,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:42,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780318480] [2019-11-28 02:54:42,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,415 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-28 02:54:42,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780318480] [2019-11-28 02:54:42,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802659157] [2019-11-28 02:54:42,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:42,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:54:42,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:42,574 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-28 02:54:42,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:42,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:54:42,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546875615] [2019-11-28 02:54:42,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:42,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:42,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:42,577 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand 4 states. [2019-11-28 02:54:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:42,949 INFO L93 Difference]: Finished difference Result 1355 states and 1932 transitions. [2019-11-28 02:54:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:42,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-28 02:54:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:42,954 INFO L225 Difference]: With dead ends: 1355 [2019-11-28 02:54:42,954 INFO L226 Difference]: Without dead ends: 903 [2019-11-28 02:54:42,955 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-28 02:54:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-28 02:54:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 532. [2019-11-28 02:54:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-28 02:54:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 761 transitions. [2019-11-28 02:54:42,982 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 761 transitions. Word has length 156 [2019-11-28 02:54:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:42,983 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 761 transitions. [2019-11-28 02:54:42,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 761 transitions. [2019-11-28 02:54:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 02:54:42,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:42,985 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, 1, 1] [2019-11-28 02:54:43,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:43,192 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:43,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1891443376, now seen corresponding path program 1 times [2019-11-28 02:54:43,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:43,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864287889] [2019-11-28 02:54:43,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,289 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-28 02:54:43,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864287889] [2019-11-28 02:54:43,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562950126] [2019-11-28 02:54:43,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:43,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:54:43,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:43,453 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-28 02:54:43,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:43,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:54:43,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420037509] [2019-11-28 02:54:43,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:43,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:43,457 INFO L87 Difference]: Start difference. First operand 532 states and 761 transitions. Second operand 4 states. [2019-11-28 02:54:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:43,941 INFO L93 Difference]: Finished difference Result 1476 states and 2098 transitions. [2019-11-28 02:54:43,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:43,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-28 02:54:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:43,949 INFO L225 Difference]: With dead ends: 1476 [2019-11-28 02:54:43,949 INFO L226 Difference]: Without dead ends: 951 [2019-11-28 02:54:43,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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-28 02:54:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-11-28 02:54:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 587. [2019-11-28 02:54:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-28 02:54:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-11-28 02:54:43,988 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 158 [2019-11-28 02:54:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:43,989 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-11-28 02:54:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-11-28 02:54:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-28 02:54:43,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:43,995 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, 1, 1, 1] [2019-11-28 02:54:44,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:44,211 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash -136801648, now seen corresponding path program 1 times [2019-11-28 02:54:44,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:44,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840073489] [2019-11-28 02:54:44,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:44,283 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-28 02:54:44,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840073489] [2019-11-28 02:54:44,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977087481] [2019-11-28 02:54:44,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:44,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:54:44,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:44,425 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-28 02:54:44,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:44,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:54:44,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788144376] [2019-11-28 02:54:44,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:44,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:44,428 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-11-28 02:54:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:44,768 INFO L93 Difference]: Finished difference Result 1484 states and 2022 transitions. [2019-11-28 02:54:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:44,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-28 02:54:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:44,774 INFO L225 Difference]: With dead ends: 1484 [2019-11-28 02:54:44,774 INFO L226 Difference]: Without dead ends: 897 [2019-11-28 02:54:44,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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-28 02:54:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-11-28 02:54:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 515. [2019-11-28 02:54:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-28 02:54:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2019-11-28 02:54:44,800 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 166 [2019-11-28 02:54:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:44,800 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2019-11-28 02:54:44,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2019-11-28 02:54:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-28 02:54:44,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:44,804 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, 1, 1, 1] [2019-11-28 02:54:45,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:45,008 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1003230858, now seen corresponding path program 1 times [2019-11-28 02:54:45,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:45,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424844968] [2019-11-28 02:54:45,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:45,129 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-28 02:54:45,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424844968] [2019-11-28 02:54:45,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:45,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:45,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439464150] [2019-11-28 02:54:45,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:45,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:45,132 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand 3 states. [2019-11-28 02:54:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:45,186 INFO L93 Difference]: Finished difference Result 1226 states and 1656 transitions. [2019-11-28 02:54:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:45,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-28 02:54:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:45,191 INFO L225 Difference]: With dead ends: 1226 [2019-11-28 02:54:45,191 INFO L226 Difference]: Without dead ends: 477 [2019-11-28 02:54:45,193 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-28 02:54:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-28 02:54:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-11-28 02:54:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-28 02:54:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 648 transitions. [2019-11-28 02:54:45,223 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 648 transitions. Word has length 168 [2019-11-28 02:54:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:45,223 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 648 transitions. [2019-11-28 02:54:45,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 648 transitions. [2019-11-28 02:54:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-28 02:54:45,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:45,230 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, 1, 1, 1] [2019-11-28 02:54:45,230 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1602987784, now seen corresponding path program 1 times [2019-11-28 02:54:45,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:45,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361411124] [2019-11-28 02:54:45,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:45,307 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-28 02:54:45,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361411124] [2019-11-28 02:54:45,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:45,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:54:45,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444642492] [2019-11-28 02:54:45,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:45,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:45,310 INFO L87 Difference]: Start difference. First operand 477 states and 648 transitions. Second operand 3 states. [2019-11-28 02:54:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:45,511 INFO L93 Difference]: Finished difference Result 964 states and 1304 transitions. [2019-11-28 02:54:45,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:45,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-28 02:54:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:45,515 INFO L225 Difference]: With dead ends: 964 [2019-11-28 02:54:45,516 INFO L226 Difference]: Without dead ends: 482 [2019-11-28 02:54:45,517 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-28 02:54:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-28 02:54:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 478. [2019-11-28 02:54:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-28 02:54:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2019-11-28 02:54:45,547 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 200 [2019-11-28 02:54:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:45,548 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2019-11-28 02:54:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2019-11-28 02:54:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-28 02:54:45,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:45,560 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, 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] [2019-11-28 02:54:45,561 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1001955789, now seen corresponding path program 1 times [2019-11-28 02:54:45,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:45,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424018889] [2019-11-28 02:54:45,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-11-28 02:54:45,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424018889] [2019-11-28 02:54:45,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:45,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:45,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533266829] [2019-11-28 02:54:45,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:45,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:45,789 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand 3 states. [2019-11-28 02:54:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:45,979 INFO L93 Difference]: Finished difference Result 985 states and 1310 transitions. [2019-11-28 02:54:45,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:45,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-11-28 02:54:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:45,982 INFO L225 Difference]: With dead ends: 985 [2019-11-28 02:54:45,983 INFO L226 Difference]: Without dead ends: 514 [2019-11-28 02:54:45,985 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-28 02:54:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-28 02:54:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-28 02:54:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 02:54:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 678 transitions. [2019-11-28 02:54:46,012 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 678 transitions. Word has length 339 [2019-11-28 02:54:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:46,013 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 678 transitions. [2019-11-28 02:54:46,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 678 transitions. [2019-11-28 02:54:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-28 02:54:46,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:46,020 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, 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] [2019-11-28 02:54:46,021 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:46,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1590673358, now seen corresponding path program 1 times [2019-11-28 02:54:46,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:46,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973728595] [2019-11-28 02:54:46,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-11-28 02:54:46,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973728595] [2019-11-28 02:54:46,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:46,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:46,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219354165] [2019-11-28 02:54:46,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:46,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:46,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:46,226 INFO L87 Difference]: Start difference. First operand 512 states and 678 transitions. Second operand 3 states. [2019-11-28 02:54:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:46,367 INFO L93 Difference]: Finished difference Result 1055 states and 1392 transitions. [2019-11-28 02:54:46,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:46,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-28 02:54:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:46,371 INFO L225 Difference]: With dead ends: 1055 [2019-11-28 02:54:46,371 INFO L226 Difference]: Without dead ends: 550 [2019-11-28 02:54:46,372 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-28 02:54:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-28 02:54:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-28 02:54:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-28 02:54:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 719 transitions. [2019-11-28 02:54:46,393 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 719 transitions. Word has length 370 [2019-11-28 02:54:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:46,393 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 719 transitions. [2019-11-28 02:54:46,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 719 transitions. [2019-11-28 02:54:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-28 02:54:46,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:46,401 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:46,402 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:46,402 INFO L82 PathProgramCache]: Analyzing trace with hash 458339096, now seen corresponding path program 1 times [2019-11-28 02:54:46,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:46,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764344673] [2019-11-28 02:54:46,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-11-28 02:54:46,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764344673] [2019-11-28 02:54:46,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:54:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:54:46,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107781642] [2019-11-28 02:54:46,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:54:46,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:46,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:54:46,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:54:46,640 INFO L87 Difference]: Start difference. First operand 548 states and 719 transitions. Second operand 3 states. [2019-11-28 02:54:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:46,692 INFO L93 Difference]: Finished difference Result 1630 states and 2135 transitions. [2019-11-28 02:54:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:54:46,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2019-11-28 02:54:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:46,698 INFO L225 Difference]: With dead ends: 1630 [2019-11-28 02:54:46,699 INFO L226 Difference]: Without dead ends: 1089 [2019-11-28 02:54:46,700 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-28 02:54:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-28 02:54:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2019-11-28 02:54:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-11-28 02:54:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2019-11-28 02:54:46,741 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 403 [2019-11-28 02:54:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:46,741 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2019-11-28 02:54:46,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:54:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2019-11-28 02:54:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-11-28 02:54:46,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:54:46,749 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:54:46,749 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:54:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:54:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash 747158486, now seen corresponding path program 1 times [2019-11-28 02:54:46,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:54:46,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862747036] [2019-11-28 02:54:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:54:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-28 02:54:46,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862747036] [2019-11-28 02:54:46,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343255983] [2019-11-28 02:54:46,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:54:47,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:54:47,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:54:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-28 02:54:47,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:54:47,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 02:54:47,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576690966] [2019-11-28 02:54:47,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:54:47,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:54:47,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:54:47,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:54:47,180 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 4 states. [2019-11-28 02:54:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:54:47,445 INFO L93 Difference]: Finished difference Result 2539 states and 3361 transitions. [2019-11-28 02:54:47,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:54:47,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-11-28 02:54:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:54:47,447 INFO L225 Difference]: With dead ends: 2539 [2019-11-28 02:54:47,447 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:54:47,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 405 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-28 02:54:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:54:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:54:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:54:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:54:47,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 403 [2019-11-28 02:54:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:54:47,451 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:54:47,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:54:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:54:47,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:54:47,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:54:47,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:54:48,830 WARN L192 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-28 02:54:49,432 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 194 [2019-11-28 02:54:49,840 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-28 02:54:50,249 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-11-28 02:54:50,525 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-11-28 02:54:50,727 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 02:54:50,925 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2019-11-28 02:54:51,150 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 02:54:51,371 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 02:54:51,624 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-28 02:54:51,861 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-28 02:54:52,068 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-11-28 02:54:52,228 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 14 [2019-11-28 02:54:52,419 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-11-28 02:54:52,649 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 14 [2019-11-28 02:54:53,037 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-11-28 02:54:54,677 WARN L192 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-28 02:54:54,890 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 6 [2019-11-28 02:54:55,107 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 48 [2019-11-28 02:54:56,703 WARN L192 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-11-28 02:54:56,883 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-11-28 02:54:56,887 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-28 02:54:56,888 INFO L246 CegarLoopResult]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-28 02:54:56,888 INFO L246 CegarLoopResult]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-28 02:54:56,888 INFO L246 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-28 02:54:56,888 INFO L246 CegarLoopResult]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-28 02:54:56,888 INFO L246 CegarLoopResult]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 02:54:56,889 INFO L246 CegarLoopResult]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-28 02:54:56,889 INFO L246 CegarLoopResult]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-28 02:54:56,889 INFO L246 CegarLoopResult]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-28 02:54:56,889 INFO L246 CegarLoopResult]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-28 02:54:56,889 INFO L246 CegarLoopResult]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-28 02:54:56,890 INFO L246 CegarLoopResult]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-28 02:54:56,890 INFO L246 CegarLoopResult]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-28 02:54:56,890 INFO L246 CegarLoopResult]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-28 02:54:56,890 INFO L246 CegarLoopResult]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-28 02:54:56,891 INFO L242 CegarLoopResult]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-28 02:54:56,891 INFO L242 CegarLoopResult]: At program point L103(lines 102 628) the Hoare annotation is: false [2019-11-28 02:54:56,891 INFO L246 CegarLoopResult]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-28 02:54:56,891 INFO L246 CegarLoopResult]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 02:54:56,891 INFO L246 CegarLoopResult]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-28 02:54:56,891 INFO L246 CegarLoopResult]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-28 02:54:56,891 INFO L246 CegarLoopResult]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-28 02:54:56,891 INFO L246 CegarLoopResult]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-28 02:54:56,892 INFO L246 CegarLoopResult]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-28 02:54:56,892 INFO L246 CegarLoopResult]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-28 02:54:56,892 INFO L246 CegarLoopResult]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 02:54:56,892 INFO L242 CegarLoopResult]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 02:54:56,892 INFO L242 CegarLoopResult]: At program point L172(lines 168 606) the Hoare annotation is: (and (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-11-28 02:54:56,893 INFO L242 CegarLoopResult]: At program point L139(lines 135 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 8545))) (.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 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse13 (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 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13))) [2019-11-28 02:54:56,893 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-28 02:54:56,893 INFO L246 CegarLoopResult]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-28 02:54:56,893 INFO L242 CegarLoopResult]: At program point L404(lines 395 415) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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-28 02:54:56,894 INFO L246 CegarLoopResult]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-28 02:54:56,894 INFO L246 CegarLoopResult]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-28 02:54:56,894 INFO L246 CegarLoopResult]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-28 02:54:56,894 INFO L246 CegarLoopResult]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-28 02:54:56,894 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 260) no Hoare annotation was computed. [2019-11-28 02:54:56,895 INFO L242 CegarLoopResult]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 02:54:56,895 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-28 02:54:56,895 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-28 02:54:56,895 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-28 02:54:56,895 INFO L246 CegarLoopResult]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-28 02:54:56,895 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-28 02:54:56,896 INFO L246 CegarLoopResult]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-28 02:54:56,896 INFO L246 CegarLoopResult]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-28 02:54:56,896 INFO L246 CegarLoopResult]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-28 02:54:56,896 INFO L246 CegarLoopResult]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-28 02:54:56,896 INFO L246 CegarLoopResult]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-28 02:54:56,896 INFO L246 CegarLoopResult]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-28 02:54:56,897 INFO L246 CegarLoopResult]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-28 02:54:56,897 INFO L246 CegarLoopResult]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-28 02:54:56,897 INFO L242 CegarLoopResult]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-11-28 02:54:56,897 INFO L242 CegarLoopResult]: At program point L145(lines 141 615) the Hoare annotation is: (and (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-28 02:54:56,897 INFO L246 CegarLoopResult]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-28 02:54:56,898 INFO L242 CegarLoopResult]: At program point L212(lines 105 627) the Hoare annotation is: false [2019-11-28 02:54:56,898 INFO L249 CegarLoopResult]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-28 02:54:56,898 INFO L246 CegarLoopResult]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-28 02:54:56,898 INFO L246 CegarLoopResult]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-28 02:54:56,898 INFO L246 CegarLoopResult]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-28 02:54:56,898 INFO L246 CegarLoopResult]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-28 02:54:56,899 INFO L246 CegarLoopResult]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-28 02:54:56,899 INFO L246 CegarLoopResult]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-28 02:54:56,899 INFO L246 CegarLoopResult]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-28 02:54:56,899 INFO L249 CegarLoopResult]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-28 02:54:56,899 INFO L246 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-28 02:54:56,900 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-28 02:54:56,900 INFO L246 CegarLoopResult]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-28 02:54:56,900 INFO L246 CegarLoopResult]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-28 02:54:56,900 INFO L246 CegarLoopResult]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-28 02:54:56,900 INFO L246 CegarLoopResult]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-28 02:54:56,900 INFO L246 CegarLoopResult]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-28 02:54:56,901 INFO L246 CegarLoopResult]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-28 02:54:56,901 INFO L246 CegarLoopResult]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-28 02:54:56,901 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-28 02:54:56,901 INFO L246 CegarLoopResult]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-28 02:54:56,901 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-28 02:54:56,902 INFO L242 CegarLoopResult]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse0 .cse1))) [2019-11-28 02:54:56,902 INFO L242 CegarLoopResult]: At program point L151(lines 147 613) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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-28 02:54:56,902 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 02:54:56,902 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:54:56,902 INFO L246 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-28 02:54:56,903 INFO L246 CegarLoopResult]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-28 02:54:56,903 INFO L246 CegarLoopResult]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-28 02:54:56,903 INFO L246 CegarLoopResult]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 02:54:56,903 INFO L246 CegarLoopResult]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-28 02:54:56,903 INFO L246 CegarLoopResult]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-28 02:54:56,903 INFO L246 CegarLoopResult]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-28 02:54:56,904 INFO L246 CegarLoopResult]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-28 02:54:56,904 INFO L246 CegarLoopResult]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-28 02:54:56,904 INFO L242 CegarLoopResult]: At program point L121(lines 117 623) the Hoare annotation is: false [2019-11-28 02:54:56,904 INFO L246 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-28 02:54:56,904 INFO L246 CegarLoopResult]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-28 02:54:56,904 INFO L246 CegarLoopResult]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-28 02:54:56,905 INFO L246 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-28 02:54:56,905 INFO L246 CegarLoopResult]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-28 02:54:56,905 INFO L246 CegarLoopResult]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-28 02:54:56,905 INFO L246 CegarLoopResult]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-28 02:54:56,905 INFO L246 CegarLoopResult]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-28 02:54:56,905 INFO L246 CegarLoopResult]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-28 02:54:56,906 INFO L242 CegarLoopResult]: At program point L553(lines 65 677) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-11-28 02:54:56,906 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-28 02:54:56,906 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:54:56,906 INFO L242 CegarLoopResult]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 02:54:56,906 INFO L242 CegarLoopResult]: At program point L157(lines 153 611) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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-28 02:54:56,907 INFO L242 CegarLoopResult]: At program point L124(lines 123 621) 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 8545))) (.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 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 02:54:56,907 INFO L246 CegarLoopResult]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-28 02:54:56,907 INFO L246 CegarLoopResult]: For program point L258(line 258) no Hoare annotation was computed. [2019-11-28 02:54:56,907 INFO L246 CegarLoopResult]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-11-28 02:54:56,907 INFO L246 CegarLoopResult]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-28 02:54:56,908 INFO L246 CegarLoopResult]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-28 02:54:56,908 INFO L246 CegarLoopResult]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-28 02:54:56,908 INFO L249 CegarLoopResult]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-28 02:54:56,908 INFO L246 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-28 02:54:56,908 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-28 02:54:56,908 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:54:56,909 INFO L246 CegarLoopResult]: For program point L260(line 260) no Hoare annotation was computed. [2019-11-28 02:54:56,909 INFO L246 CegarLoopResult]: For program point L260-1(line 260) no Hoare annotation was computed. [2019-11-28 02:54:56,909 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 258) no Hoare annotation was computed. [2019-11-28 02:54:56,909 INFO L242 CegarLoopResult]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-11-28 02:54:56,910 INFO L246 CegarLoopResult]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-28 02:54:56,910 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-28 02:54:56,910 INFO L242 CegarLoopResult]: At program point L360(lines 342 378) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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-28 02:54:56,910 INFO L246 CegarLoopResult]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-28 02:54:56,910 INFO L246 CegarLoopResult]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-28 02:54:56,911 INFO L246 CegarLoopResult]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-28 02:54:56,911 INFO L246 CegarLoopResult]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-28 02:54:56,911 INFO L246 CegarLoopResult]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-28 02:54:56,911 INFO L246 CegarLoopResult]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-28 02:54:56,911 INFO L242 CegarLoopResult]: At program point L394(lines 385 416) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 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-28 02:54:56,912 INFO L246 CegarLoopResult]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-28 02:54:56,912 INFO L242 CegarLoopResult]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 02:54:56,912 INFO L242 CegarLoopResult]: At program point L163(lines 159 609) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (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-28 02:54:56,912 INFO L246 CegarLoopResult]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-28 02:54:56,912 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-28 02:54:56,913 INFO L249 CegarLoopResult]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-28 02:54:56,913 INFO L246 CegarLoopResult]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-28 02:54:56,913 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-28 02:54:56,913 INFO L246 CegarLoopResult]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-28 02:54:56,913 INFO L246 CegarLoopResult]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-28 02:54:56,914 INFO L246 CegarLoopResult]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-28 02:54:56,914 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse6 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse11 .cse9 .cse10 .cse12 .cse13) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse12 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse0 .cse8 .cse11 .cse9 .cse10 .cse1 .cse13))) [2019-11-28 02:54:56,914 INFO L242 CegarLoopResult]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.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 8545))) (.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))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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))) (.cse16 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 02:54:56,915 INFO L242 CegarLoopResult]: At program point L133(lines 126 620) 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 8545))) (.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 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.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 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 02:54:56,915 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 02:54:56,915 INFO L246 CegarLoopResult]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-28 02:54:56,915 INFO L246 CegarLoopResult]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-28 02:54:56,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:54:56 BoogieIcfgContainer [2019-11-28 02:54:56,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:54:56,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:54:56,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:54:56,956 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:54:56,957 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:54:36" (3/4) ... [2019-11-28 02:54:56,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:54:56,980 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 02:54:56,981 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:54:57,091 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:54:57,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:54:57,093 INFO L168 Benchmark]: Toolchain (without parser) took 22158.32 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 588.3 MB). Free memory was 961.7 MB in the beginning and 915.0 MB in the end (delta: 46.7 MB). Peak memory consumption was 635.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:57,094 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:54:57,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:57,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.26 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:57,095 INFO L168 Benchmark]: Boogie Preprocessor took 40.82 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-28 02:54:57,095 INFO L168 Benchmark]: RCFGBuilder took 904.14 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:57,096 INFO L168 Benchmark]: TraceAbstraction took 20438.59 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 1.1 GB in the beginning and 930.2 MB in the end (delta: 140.3 MB). Peak memory consumption was 598.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:57,096 INFO L168 Benchmark]: Witness Printer took 136.05 ms. Allocated memory is still 1.6 GB. Free memory was 930.2 MB in the beginning and 915.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:54:57,098 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 569.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.26 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.82 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 904.14 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: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20438.59 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 1.1 GB in the beginning and 930.2 MB in the end (delta: 140.3 MB). Peak memory consumption was 598.0 MB. Max. memory is 11.5 GB. * Witness Printer took 136.05 ms. Allocated memory is still 1.6 GB. Free memory was 930.2 MB in the beginning and 915.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 260]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((!(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 == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((!(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 == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((!(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__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0)) || (((((((((((((((((!(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 == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((!(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 == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || ((((((((((((((((!(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 == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 186]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((((!(s__state == 8673) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 198]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8656) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) || ((((((!(s__state == 8656) && !(s__state == 8576)) && !(s__state == 8657)) && !(s__state == 16384)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 147]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 180]: Loop Invariant Derived loop invariant: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((!(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: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((8576 <= s__state && s__state <= 8640) && !(0 == s__hit)) || ((!(s__state == 8576) && 8576 <= s__state) && s__state <= 8640) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((!(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)) || ((((((((((((((!(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 == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8657) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 8576 <= s__state && s__state <= 8640 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8529)) && !(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: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(s__state == 8657) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545))) || ((((((((((((!(s__state == 8513) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(0 == s__hit))) || (((((((((((!(s__state == 8561) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8545))) || (((((((((((!(s__state == 8561) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8513)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8673) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || ((((((!(s__state == 8673) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 4 error locations. Result: SAFE, OverallTime: 11.0s, OverallIterations: 32, TraceHistogramMax: 14, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, HoareTripleCheckerStatistics: 5368 SDtfs, 4720 SDslu, 2130 SDs, 0 SdLazy, 3171 SolverSat, 1069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 964 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1087occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 1658 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 206 NumberOfFragments, 1796 HoareAnnotationTreeSize, 29 FomulaSimplifications, 249232 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 93537 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 5109 NumberOfCodeBlocks, 5109 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5073 ConstructedInterpolants, 0 QuantifiedInterpolants, 1687384 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 36 InterpolantComputations, 28 PerfectInterpolantSequences, 11171/11219 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...