./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:00:26,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:00:26,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:00:26,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:00:26,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:00:26,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:00:26,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:00:26,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:00:26,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:00:26,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:00:26,642 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:00:26,643 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:00:26,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:00:26,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:00:26,645 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:00:26,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:00:26,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:00:26,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:00:26,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:00:26,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:00:26,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:00:26,651 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:00:26,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:00:26,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:00:26,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:00:26,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:00:26,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:00:26,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:00:26,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:00:26,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:00:26,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:00:26,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:00:26,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:00:26,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:00:26,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:00:26,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:00:26,658 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 07:00:26,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:00:26,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:00:26,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:00:26,669 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:00:26,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:00:26,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:00:26,669 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:00:26,670 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:00:26,670 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:00:26,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:00:26,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:00:26,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:00:26,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:00:26,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:00:26,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:00:26,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:00:26,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:00:26,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:00:26,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:00:26,672 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:00:26,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:00:26,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:00:26,672 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2018-11-10 07:00:26,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:00:26,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:00:26,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:00:26,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:00:26,708 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:00:26,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 07:00:26,751 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/data/74371653e/65532a927dd542f89331b54303301116/FLAG2725efde0 [2018-11-10 07:00:27,137 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:00:27,137 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/sv-benchmarks/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 07:00:27,141 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/data/74371653e/65532a927dd542f89331b54303301116/FLAG2725efde0 [2018-11-10 07:00:27,150 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/data/74371653e/65532a927dd542f89331b54303301116 [2018-11-10 07:00:27,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:00:27,154 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:00:27,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:00:27,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:00:27,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:00:27,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347b18a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27, skipping insertion in model container [2018-11-10 07:00:27,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:00:27,175 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:00:27,270 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:00:27,272 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:00:27,281 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:00:27,288 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:00:27,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27 WrapperNode [2018-11-10 07:00:27,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:00:27,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:00:27,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:00:27,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:00:27,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... [2018-11-10 07:00:27,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:00:27,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:00:27,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:00:27,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:00:27,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:00:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:00:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:00:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-10 07:00:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-10 07:00:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:00:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:00:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-10 07:00:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-10 07:00:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:00:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:00:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:00:27,547 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:00:27,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:00:27 BoogieIcfgContainer [2018-11-10 07:00:27,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:00:27,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:00:27,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:00:27,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:00:27,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:00:27" (1/3) ... [2018-11-10 07:00:27,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f074333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:27, skipping insertion in model container [2018-11-10 07:00:27,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:27" (2/3) ... [2018-11-10 07:00:27,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f074333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:27, skipping insertion in model container [2018-11-10 07:00:27,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:00:27" (3/3) ... [2018-11-10 07:00:27,556 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 07:00:27,565 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:00:27,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 07:00:27,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 07:00:27,606 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:00:27,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:00:27,606 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:00:27,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:00:27,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:00:27,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:00:27,607 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:00:27,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:00:27,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:00:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-10 07:00:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 07:00:27,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:27,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:27,626 INFO L424 AbstractCegarLoop]: === Iteration 1 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:27,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash -359085562, now seen corresponding path program 1 times [2018-11-10 07:00:27,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:27,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:27,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:27,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:00:27,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:00:27,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:00:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:00:27,795 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 7 states. [2018-11-10 07:00:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:27,964 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-11-10 07:00:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:00:27,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-10 07:00:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:27,974 INFO L225 Difference]: With dead ends: 91 [2018-11-10 07:00:27,974 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 07:00:27,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:00:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 07:00:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-11-10 07:00:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 07:00:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-10 07:00:28,014 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 12 [2018-11-10 07:00:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,014 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-10 07:00:28,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:00:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-10 07:00:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 07:00:28,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,015 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,016 INFO L424 AbstractCegarLoop]: === Iteration 2 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1753249505, now seen corresponding path program 1 times [2018-11-10 07:00:28,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:28,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:00:28,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:28,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:28,041 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-11-10 07:00:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,056 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-10 07:00:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:28,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 07:00:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,057 INFO L225 Difference]: With dead ends: 74 [2018-11-10 07:00:28,057 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 07:00:28,057 INFO L605 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 [2018-11-10 07:00:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 07:00:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-10 07:00:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 07:00:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2018-11-10 07:00:28,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 13 [2018-11-10 07:00:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,065 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2018-11-10 07:00:28,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2018-11-10 07:00:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:00:28,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,065 INFO L424 AbstractCegarLoop]: === Iteration 3 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1245225281, now seen corresponding path program 1 times [2018-11-10 07:00:28,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:00:28,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:28,092 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand 3 states. [2018-11-10 07:00:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,100 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2018-11-10 07:00:28,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:28,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 07:00:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,102 INFO L225 Difference]: With dead ends: 69 [2018-11-10 07:00:28,102 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 07:00:28,103 INFO L605 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 [2018-11-10 07:00:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 07:00:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 07:00:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 07:00:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-10 07:00:28,111 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 15 [2018-11-10 07:00:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,111 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-10 07:00:28,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-10 07:00:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:00:28,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,112 INFO L424 AbstractCegarLoop]: === Iteration 4 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -52721888, now seen corresponding path program 1 times [2018-11-10 07:00:28,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:28,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:00:28,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:00:28,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:28,134 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 4 states. [2018-11-10 07:00:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,151 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-10 07:00:28,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:00:28,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-10 07:00:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,153 INFO L225 Difference]: With dead ends: 89 [2018-11-10 07:00:28,153 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 07:00:28,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 07:00:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-11-10 07:00:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 07:00:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2018-11-10 07:00:28,159 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 16 [2018-11-10 07:00:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,160 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-11-10 07:00:28,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:00:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2018-11-10 07:00:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:00:28,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,161 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,161 INFO L424 AbstractCegarLoop]: === Iteration 5 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -571942417, now seen corresponding path program 1 times [2018-11-10 07:00:28,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:00:28,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:00:28,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:28,179 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 3 states. [2018-11-10 07:00:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,187 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2018-11-10 07:00:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:28,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 07:00:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,188 INFO L225 Difference]: With dead ends: 78 [2018-11-10 07:00:28,188 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 07:00:28,188 INFO L605 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 [2018-11-10 07:00:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 07:00:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-10 07:00:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:00:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-10 07:00:28,196 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 20 [2018-11-10 07:00:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,196 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-10 07:00:28,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-10 07:00:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:00:28,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,197 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,198 INFO L424 AbstractCegarLoop]: === Iteration 6 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash -550345698, now seen corresponding path program 1 times [2018-11-10 07:00:28,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:00:28,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:28,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:00:28,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:00:28,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:28,229 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-11-10 07:00:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,256 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2018-11-10 07:00:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:00:28,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-10 07:00:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,258 INFO L225 Difference]: With dead ends: 98 [2018-11-10 07:00:28,258 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 07:00:28,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 07:00:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-11-10 07:00:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 07:00:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2018-11-10 07:00:28,266 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 21 [2018-11-10 07:00:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,267 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2018-11-10 07:00:28,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:00:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2018-11-10 07:00:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:00:28,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,268 INFO L424 AbstractCegarLoop]: === Iteration 7 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 838473927, now seen corresponding path program 1 times [2018-11-10 07:00:28,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:00:28,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:00:28,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:00:28,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:00:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:00:28,309 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand 5 states. [2018-11-10 07:00:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,350 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2018-11-10 07:00:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:00:28,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-10 07:00:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,351 INFO L225 Difference]: With dead ends: 129 [2018-11-10 07:00:28,352 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 07:00:28,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:00:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 07:00:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-10 07:00:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:00:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2018-11-10 07:00:28,360 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 23 [2018-11-10 07:00:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,360 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2018-11-10 07:00:28,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:00:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2018-11-10 07:00:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:00:28,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,361 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,362 INFO L424 AbstractCegarLoop]: === Iteration 8 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2032985165, now seen corresponding path program 1 times [2018-11-10 07:00:28,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:00:28,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:00:28,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:00:28,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:00:28,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:00:28,401 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 5 states. [2018-11-10 07:00:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,455 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-10 07:00:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:00:28,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 07:00:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,456 INFO L225 Difference]: With dead ends: 102 [2018-11-10 07:00:28,456 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 07:00:28,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:00:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 07:00:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-10 07:00:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 07:00:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2018-11-10 07:00:28,465 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 25 [2018-11-10 07:00:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,466 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2018-11-10 07:00:28,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:00:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2018-11-10 07:00:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 07:00:28,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,467 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,467 INFO L424 AbstractCegarLoop]: === Iteration 9 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1980125912, now seen corresponding path program 1 times [2018-11-10 07:00:28,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 07:00:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:00:28,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:00:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:00:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:00:28,499 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand 5 states. [2018-11-10 07:00:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,575 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2018-11-10 07:00:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:00:28,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-10 07:00:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,576 INFO L225 Difference]: With dead ends: 123 [2018-11-10 07:00:28,576 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 07:00:28,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:00:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 07:00:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-10 07:00:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 07:00:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2018-11-10 07:00:28,587 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 31 [2018-11-10 07:00:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,588 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2018-11-10 07:00:28,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:00:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-10 07:00:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:00:28,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,589 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,589 INFO L424 AbstractCegarLoop]: === Iteration 10 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1444432349, now seen corresponding path program 1 times [2018-11-10 07:00:28,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 07:00:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:28,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:00:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:00:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:28,626 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 4 states. [2018-11-10 07:00:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,645 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-11-10 07:00:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:00:28,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-10 07:00:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,648 INFO L225 Difference]: With dead ends: 132 [2018-11-10 07:00:28,648 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 07:00:28,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 07:00:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-10 07:00:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 07:00:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 162 transitions. [2018-11-10 07:00:28,659 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 162 transitions. Word has length 34 [2018-11-10 07:00:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,660 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 162 transitions. [2018-11-10 07:00:28,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:00:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-10 07:00:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 07:00:28,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,661 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,662 INFO L424 AbstractCegarLoop]: === Iteration 11 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1827729912, now seen corresponding path program 1 times [2018-11-10 07:00:28,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:00:28,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:00:28,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:28,697 INFO L87 Difference]: Start difference. First operand 127 states and 162 transitions. Second operand 3 states. [2018-11-10 07:00:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,705 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-10 07:00:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:28,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 07:00:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,707 INFO L225 Difference]: With dead ends: 127 [2018-11-10 07:00:28,707 INFO L226 Difference]: Without dead ends: 126 [2018-11-10 07:00:28,707 INFO L605 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 [2018-11-10 07:00:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-10 07:00:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-10 07:00:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 07:00:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2018-11-10 07:00:28,715 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 35 [2018-11-10 07:00:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,716 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2018-11-10 07:00:28,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2018-11-10 07:00:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:00:28,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,717 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,717 INFO L424 AbstractCegarLoop]: === Iteration 12 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 324073318, now seen corresponding path program 1 times [2018-11-10 07:00:28,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:00:28,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:00:28,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:00:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:00:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:00:28,772 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand 5 states. [2018-11-10 07:00:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,813 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-11-10 07:00:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:00:28,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-10 07:00:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,815 INFO L225 Difference]: With dead ends: 126 [2018-11-10 07:00:28,815 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 07:00:28,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:00:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 07:00:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-10 07:00:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 07:00:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2018-11-10 07:00:28,824 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 40 [2018-11-10 07:00:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,824 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2018-11-10 07:00:28,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:00:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2018-11-10 07:00:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:00:28,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,826 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 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] [2018-11-10 07:00:28,827 INFO L424 AbstractCegarLoop]: === Iteration 13 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash 364458084, now seen corresponding path program 1 times [2018-11-10 07:00:28,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 07:00:28,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:28,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:00:28,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:00:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:00:28,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:00:28,883 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand 5 states. [2018-11-10 07:00:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:28,908 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2018-11-10 07:00:28,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:00:28,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-10 07:00:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:28,910 INFO L225 Difference]: With dead ends: 125 [2018-11-10 07:00:28,910 INFO L226 Difference]: Without dead ends: 124 [2018-11-10 07:00:28,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:00:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-10 07:00:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2018-11-10 07:00:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 07:00:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-11-10 07:00:28,920 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 45 [2018-11-10 07:00:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:28,920 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-11-10 07:00:28,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:00:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-10 07:00:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 07:00:28,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:28,921 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:28,924 INFO L424 AbstractCegarLoop]: === Iteration 14 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:28,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash -921113151, now seen corresponding path program 1 times [2018-11-10 07:00:28,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:28,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:28,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 07:00:28,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:00:28,982 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:00:28,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:00:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 07:00:29,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:00:29,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 07:00:29,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:00:29,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:00:29,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:00:29,048 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2018-11-10 07:00:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:29,105 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2018-11-10 07:00:29,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:00:29,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-10 07:00:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:29,108 INFO L225 Difference]: With dead ends: 223 [2018-11-10 07:00:29,108 INFO L226 Difference]: Without dead ends: 146 [2018-11-10 07:00:29,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:00:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-10 07:00:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2018-11-10 07:00:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 07:00:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-11-10 07:00:29,122 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 47 [2018-11-10 07:00:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:29,122 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-11-10 07:00:29,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:00:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-11-10 07:00:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 07:00:29,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:29,123 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-10 07:00:29,124 INFO L424 AbstractCegarLoop]: === Iteration 15 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:29,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash -922396984, now seen corresponding path program 1 times [2018-11-10 07:00:29,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:29,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:29,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:00:29,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:29,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:00:29,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:00:29,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:00:29,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:00:29,158 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 3 states. [2018-11-10 07:00:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:29,168 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2018-11-10 07:00:29,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:00:29,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 07:00:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:29,170 INFO L225 Difference]: With dead ends: 128 [2018-11-10 07:00:29,170 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 07:00:29,170 INFO L605 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 [2018-11-10 07:00:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 07:00:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-10 07:00:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 07:00:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-11-10 07:00:29,179 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 47 [2018-11-10 07:00:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:29,179 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-11-10 07:00:29,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:00:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-11-10 07:00:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:00:29,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:29,180 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-10 07:00:29,181 INFO L424 AbstractCegarLoop]: === Iteration 16 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:29,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1470464639, now seen corresponding path program 1 times [2018-11-10 07:00:29,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:29,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:00:29,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:00:29,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:00:29,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:00:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:00:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:29,227 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 4 states. [2018-11-10 07:00:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:29,243 INFO L93 Difference]: Finished difference Result 136 states and 163 transitions. [2018-11-10 07:00:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:00:29,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-10 07:00:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:29,244 INFO L225 Difference]: With dead ends: 136 [2018-11-10 07:00:29,244 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 07:00:29,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:00:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 07:00:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-10 07:00:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 07:00:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2018-11-10 07:00:29,252 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 48 [2018-11-10 07:00:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:29,253 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2018-11-10 07:00:29,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:00:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2018-11-10 07:00:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 07:00:29,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:29,254 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 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] [2018-11-10 07:00:29,254 INFO L424 AbstractCegarLoop]: === Iteration 17 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:29,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash -524468521, now seen corresponding path program 1 times [2018-11-10 07:00:29,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:29,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 07:00:29,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:00:29,348 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:00:29,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:00:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 07:00:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:00:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 07:00:29,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:00:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:00:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:00:29,418 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 6 states. [2018-11-10 07:00:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:29,486 INFO L93 Difference]: Finished difference Result 262 states and 341 transitions. [2018-11-10 07:00:29,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:00:29,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-10 07:00:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:29,487 INFO L225 Difference]: With dead ends: 262 [2018-11-10 07:00:29,487 INFO L226 Difference]: Without dead ends: 150 [2018-11-10 07:00:29,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:00:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-10 07:00:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2018-11-10 07:00:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 07:00:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2018-11-10 07:00:29,496 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 58 [2018-11-10 07:00:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:29,496 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2018-11-10 07:00:29,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:00:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2018-11-10 07:00:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 07:00:29,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:29,497 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:29,498 INFO L424 AbstractCegarLoop]: === Iteration 18 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:29,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1040597731, now seen corresponding path program 2 times [2018-11-10 07:00:29,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:29,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:00:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 23 proven. 86 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-10 07:00:29,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:00:29,557 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:00:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:00:29,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:00:29,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:00:29,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:00:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 231 proven. 15 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-10 07:00:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:00:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 07:00:29,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:00:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:00:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:00:29,637 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand 6 states. [2018-11-10 07:00:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:29,708 INFO L93 Difference]: Finished difference Result 296 states and 391 transitions. [2018-11-10 07:00:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:00:29,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-10 07:00:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:29,710 INFO L225 Difference]: With dead ends: 296 [2018-11-10 07:00:29,710 INFO L226 Difference]: Without dead ends: 174 [2018-11-10 07:00:29,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:00:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-10 07:00:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2018-11-10 07:00:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 07:00:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 190 transitions. [2018-11-10 07:00:29,719 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 190 transitions. Word has length 111 [2018-11-10 07:00:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:29,719 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 190 transitions. [2018-11-10 07:00:29,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:00:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 190 transitions. [2018-11-10 07:00:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 07:00:29,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:00:29,721 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:00:29,721 INFO L424 AbstractCegarLoop]: === Iteration 19 === [rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 07:00:29,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:00:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash -296486197, now seen corresponding path program 3 times [2018-11-10 07:00:29,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:00:29,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:00:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:00:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:00:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:00:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 49 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-10 07:00:29,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:00:29,783 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:00:29,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:00:29,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 07:00:29,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:00:29,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:00:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-11-10 07:00:29,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:00:29,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2018-11-10 07:00:29,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:00:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:00:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:00:29,868 INFO L87 Difference]: Start difference. First operand 154 states and 190 transitions. Second operand 9 states. [2018-11-10 07:00:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:00:29,980 INFO L93 Difference]: Finished difference Result 209 states and 263 transitions. [2018-11-10 07:00:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:00:29,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-11-10 07:00:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:00:29,981 INFO L225 Difference]: With dead ends: 209 [2018-11-10 07:00:29,981 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:00:29,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:00:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:00:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:00:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:00:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:00:29,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-11-10 07:00:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:00:29,983 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:00:29,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:00:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:00:29,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:00:29,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:00:30,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:00:30,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:00:30,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:00:30,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:00:30,260 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:00:30,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-10 07:00:30,261 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= rec1_~i |rec1_#in~i|) (< 2147483647 |rec1_#in~i|)) (or (<= 1 rec1_~i) (< 2147483646 |rec1_#in~i|))) [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= |rec1_#t~ret1| 0) (= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-10 07:00:30,262 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (< 0 |rec2_#in~j|) (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))) [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 0 (+ |rec2_#t~ret3| 2147483647)) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (< 0 |rec2_#in~j|)) [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,263 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:00:30,264 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-10 07:00:30,264 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-10 07:00:30,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:00:30 BoogieIcfgContainer [2018-11-10 07:00:30,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:00:30,267 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:00:30,267 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:00:30,268 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:00:30,268 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:00:27" (3/4) ... [2018-11-10 07:00:30,271 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:00:30,277 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:00:30,277 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-10 07:00:30,277 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-10 07:00:30,277 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:00:30,281 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 07:00:30,282 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:00:30,282 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:00:30,317 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cc20a84a-52d9-473f-880a-6bb928d4e5ab/bin-2019/uautomizer/witness.graphml [2018-11-10 07:00:30,318 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:00:30,321 INFO L168 Benchmark]: Toolchain (without parser) took 3167.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 962.5 MB in the beginning and 866.0 MB in the end (delta: 96.5 MB). Peak memory consumption was 220.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:30,322 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:00:30,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.88 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 950.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:30,322 INFO L168 Benchmark]: Boogie Preprocessor took 21.46 ms. Allocated memory is still 1.0 GB. Free memory is still 950.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:00:30,322 INFO L168 Benchmark]: RCFGBuilder took 237.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:30,323 INFO L168 Benchmark]: TraceAbstraction took 2718.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.1 MB in the end (delta: 240.2 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:30,323 INFO L168 Benchmark]: Witness Printer took 50.36 ms. Allocated memory is still 1.2 GB. Free memory was 871.1 MB in the beginning and 866.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:00:30,324 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.88 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 950.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.46 ms. Allocated memory is still 1.0 GB. Free memory is still 950.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 237.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2718.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.1 MB in the end (delta: 240.2 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. * Witness Printer took 50.36 ms. Allocated memory is still 1.2 GB. Free memory was 871.1 MB in the beginning and 866.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 2.6s OverallTime, 19 OverallIterations, 14 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 779 SDtfs, 293 SDslu, 1707 SDs, 0 SdLazy, 589 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 121 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 343 PreInvPairs, 383 NumberOfFragments, 111 HoareAnnotationTreeSize, 343 FomulaSimplifications, 1817 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 228 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1046 ConstructedInterpolants, 0 QuantifiedInterpolants, 98472 SizeOfPredicates, 5 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 1711/1923 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...