./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/genady_true-termination_true-no-overflow.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_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 6938b5c805400363799492c040263d9022406929 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:12:08,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:12:08,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:12:08,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:12:08,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:12:08,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:12:08,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:12:08,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:12:08,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:12:08,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:12:08,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:12:08,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:12:08,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:12:08,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:12:08,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:12:08,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:12:08,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:12:08,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:12:08,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:12:08,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:12:08,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:12:08,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:12:08,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:12:08,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:12:08,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:12:08,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:12:08,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:12:08,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:12:08,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:12:08,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:12:08,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:12:08,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:12:08,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:12:08,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:12:08,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:12:08,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:12:08,386 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 06:12:08,393 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:12:08,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:12:08,394 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:12:08,394 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:12:08,395 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:12:08,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:12:08,395 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:12:08,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:12:08,395 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:12:08,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:12:08,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:12:08,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:12:08,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:12:08,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:12:08,396 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 06:12:08,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:12:08,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:12:08,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:12:08,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:12:08,397 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:12:08,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:12:08,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:12:08,398 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_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 -> 6938b5c805400363799492c040263d9022406929 [2018-11-10 06:12:08,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:12:08,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:12:08,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:12:08,431 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:12:08,431 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:12:08,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c [2018-11-10 06:12:08,476 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/data/4409ebbf6/973ce4af06944346beb0a06a922410a2/FLAGa1a7efeed [2018-11-10 06:12:08,857 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:12:08,857 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/sv-benchmarks/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c [2018-11-10 06:12:08,861 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/data/4409ebbf6/973ce4af06944346beb0a06a922410a2/FLAGa1a7efeed [2018-11-10 06:12:08,869 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/data/4409ebbf6/973ce4af06944346beb0a06a922410a2 [2018-11-10 06:12:08,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:12:08,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 06:12:08,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:12:08,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:12:08,876 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:12:08,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:12:08" (1/1) ... [2018-11-10 06:12:08,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf9e623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:08, skipping insertion in model container [2018-11-10 06:12:08,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:12:08" (1/1) ... [2018-11-10 06:12:08,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:12:08,893 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:12:08,983 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:12:08,986 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:12:08,994 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:12:09,003 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:12:09,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09 WrapperNode [2018-11-10 06:12:09,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:12:09,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:12:09,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:12:09,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:12:09,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... [2018-11-10 06:12:09,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:12:09,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:12:09,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:12:09,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:12:09,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 06:12:09,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:12:09,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:12:09,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:12:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 06:12:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:12:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:12:09,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:12:09,231 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:12:09,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:12:09 BoogieIcfgContainer [2018-11-10 06:12:09,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:12:09,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:12:09,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:12:09,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:12:09,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:12:08" (1/3) ... [2018-11-10 06:12:09,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431f50d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:12:09, skipping insertion in model container [2018-11-10 06:12:09,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:12:09" (2/3) ... [2018-11-10 06:12:09,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431f50d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:12:09, skipping insertion in model container [2018-11-10 06:12:09,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:12:09" (3/3) ... [2018-11-10 06:12:09,237 INFO L112 eAbstractionObserver]: Analyzing ICFG genady_true-termination_true-no-overflow.c [2018-11-10 06:12:09,245 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:12:09,252 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 06:12:09,266 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 06:12:09,291 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:12:09,292 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:12:09,292 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:12:09,292 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:12:09,292 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:12:09,292 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:12:09,292 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:12:09,292 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:12:09,292 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:12:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-10 06:12:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 06:12:09,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,312 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,314 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash 109650244, now seen corresponding path program 1 times [2018-11-10 06:12:09,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,432 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 06:12:09,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:09,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:12:09,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:12:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:12:09,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:12:09,451 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-11-10 06:12:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:09,504 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-10 06:12:09,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:12:09,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-10 06:12:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:09,511 INFO L225 Difference]: With dead ends: 29 [2018-11-10 06:12:09,511 INFO L226 Difference]: Without dead ends: 18 [2018-11-10 06:12:09,513 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 06:12:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-10 06:12:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 06:12:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 06:12:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-10 06:12:09,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2018-11-10 06:12:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:09,535 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-10 06:12:09,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:12:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-10 06:12:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 06:12:09,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,537 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,537 INFO L82 PathProgramCache]: Analyzing trace with hash -895809689, now seen corresponding path program 1 times [2018-11-10 06:12:09,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,578 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 06:12:09,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:09,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:12:09,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:12:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:12:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:12:09,580 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-11-10 06:12:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:09,614 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-10 06:12:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:12:09,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-10 06:12:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:09,615 INFO L225 Difference]: With dead ends: 27 [2018-11-10 06:12:09,615 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 06:12:09,616 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 06:12:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 06:12:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-11-10 06:12:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 06:12:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 06:12:09,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2018-11-10 06:12:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:09,621 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 06:12:09,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:12:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 06:12:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 06:12:09,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,621 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,622 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1879650391, now seen corresponding path program 1 times [2018-11-10 06:12:09,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,643 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 06:12:09,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:09,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:12:09,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:12:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:12:09,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:12:09,644 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-10 06:12:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:09,673 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 06:12:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:12:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 06:12:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:09,674 INFO L225 Difference]: With dead ends: 25 [2018-11-10 06:12:09,674 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 06:12:09,675 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 06:12:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 06:12:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-10 06:12:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 06:12:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-10 06:12:09,678 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2018-11-10 06:12:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:09,678 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-10 06:12:09,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:12:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-10 06:12:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 06:12:09,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,680 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,680 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1860380075, now seen corresponding path program 1 times [2018-11-10 06:12:09,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,701 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 06:12:09,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:09,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:12:09,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:12:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:12:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:12:09,702 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 3 states. [2018-11-10 06:12:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:09,728 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-10 06:12:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:12:09,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 06:12:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:09,729 INFO L225 Difference]: With dead ends: 23 [2018-11-10 06:12:09,729 INFO L226 Difference]: Without dead ends: 22 [2018-11-10 06:12:09,729 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 06:12:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-10 06:12:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 06:12:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 06:12:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-10 06:12:09,732 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 11 [2018-11-10 06:12:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:09,733 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-10 06:12:09,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:12:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-10 06:12:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 06:12:09,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,734 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1837207531, now seen corresponding path program 1 times [2018-11-10 06:12:09,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,757 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 06:12:09,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:09,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:12:09,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:12:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:12:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:12:09,758 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 3 states. [2018-11-10 06:12:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:09,775 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-10 06:12:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:12:09,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 06:12:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:09,776 INFO L225 Difference]: With dead ends: 22 [2018-11-10 06:12:09,776 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 06:12:09,776 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 06:12:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 06:12:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 06:12:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 06:12:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 06:12:09,779 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2018-11-10 06:12:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:09,780 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 06:12:09,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:12:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 06:12:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 06:12:09,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,781 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1118858669, now seen corresponding path program 1 times [2018-11-10 06:12:09,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,799 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 06:12:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:12:09,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:12:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:12:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:12:09,800 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-11-10 06:12:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:09,828 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-10 06:12:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:12:09,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 06:12:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:09,829 INFO L225 Difference]: With dead ends: 25 [2018-11-10 06:12:09,829 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 06:12:09,829 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 06:12:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 06:12:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 06:12:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 06:12:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-10 06:12:09,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2018-11-10 06:12:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:09,833 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-10 06:12:09,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:12:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-10 06:12:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 06:12:09,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:09,833 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:09,833 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:09,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:09,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1322538245, now seen corresponding path program 1 times [2018-11-10 06:12:09,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:09,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:09,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:12:09,886 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 06:12:09,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:09,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:12:09,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-10 06:12:09,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 06:12:09,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 06:12:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:12:09,974 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-10 06:12:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,085 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-10 06:12:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 06:12:10,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-10 06:12:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,086 INFO L225 Difference]: With dead ends: 32 [2018-11-10 06:12:10,086 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 06:12:10,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-11-10 06:12:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 06:12:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-10 06:12:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 06:12:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 06:12:10,089 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 16 [2018-11-10 06:12:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,089 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 06:12:10,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 06:12:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 06:12:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 06:12:10,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,090 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,090 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 351067709, now seen corresponding path program 1 times [2018-11-10 06:12:10,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:12:10,109 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 06:12:10,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:12:10,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 06:12:10,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:12:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:12:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:12:10,142 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 4 states. [2018-11-10 06:12:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,165 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-10 06:12:10,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:12:10,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-10 06:12:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,166 INFO L225 Difference]: With dead ends: 31 [2018-11-10 06:12:10,166 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 06:12:10,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:12:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 06:12:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-10 06:12:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 06:12:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-10 06:12:10,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 18 [2018-11-10 06:12:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,171 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-10 06:12:10,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:12:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-10 06:12:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 06:12:10,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,172 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,172 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 412804761, now seen corresponding path program 1 times [2018-11-10 06:12:10,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:10,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:12:10,196 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 06:12:10,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:12:10,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 06:12:10,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:12:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:12:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:12:10,239 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 4 states. [2018-11-10 06:12:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,261 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-10 06:12:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:12:10,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-10 06:12:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,262 INFO L225 Difference]: With dead ends: 33 [2018-11-10 06:12:10,262 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 06:12:10,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:12:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 06:12:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 06:12:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 06:12:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-10 06:12:10,265 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2018-11-10 06:12:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,265 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-10 06:12:10,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:12:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-10 06:12:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 06:12:10,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,266 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,266 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1375304335, now seen corresponding path program 2 times [2018-11-10 06:12:10,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:12:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:12:10,313 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/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 06:12:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:12:10,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:12:10,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:12:10,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:12:10,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-10 06:12:10,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 06:12:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 06:12:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-10 06:12:10,426 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-10 06:12:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,575 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-10 06:12:10,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:12:10,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-11-10 06:12:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,577 INFO L225 Difference]: With dead ends: 40 [2018-11-10 06:12:10,577 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 06:12:10,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2018-11-10 06:12:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 06:12:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-10 06:12:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 06:12:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-10 06:12:10,580 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 24 [2018-11-10 06:12:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,580 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-10 06:12:10,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 06:12:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-10 06:12:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 06:12:10,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,581 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,581 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1182459695, now seen corresponding path program 2 times [2018-11-10 06:12:10,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:12:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:12:10,618 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:12:10,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:12:10,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:12:10,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:12:10,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:12:10,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 06:12:10,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:12:10,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:12:10,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:12:10,668 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 5 states. [2018-11-10 06:12:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,686 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-10 06:12:10,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:12:10,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-10 06:12:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,687 INFO L225 Difference]: With dead ends: 39 [2018-11-10 06:12:10,687 INFO L226 Difference]: Without dead ends: 38 [2018-11-10 06:12:10,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:12:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-10 06:12:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-10 06:12:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 06:12:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-10 06:12:10,690 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 26 [2018-11-10 06:12:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,690 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-10 06:12:10,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:12:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-10 06:12:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 06:12:10,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,691 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,691 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash 665039749, now seen corresponding path program 2 times [2018-11-10 06:12:10,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:12:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:12:10,718 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:12:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:12:10,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:12:10,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:12:10,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:10,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:12:10,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-10 06:12:10,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 06:12:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 06:12:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:12:10,789 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 9 states. [2018-11-10 06:12:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,863 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-10 06:12:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:12:10,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-10 06:12:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,864 INFO L225 Difference]: With dead ends: 44 [2018-11-10 06:12:10,864 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 06:12:10,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-11-10 06:12:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 06:12:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-10 06:12:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 06:12:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-10 06:12:10,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-11-10 06:12:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,868 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-10 06:12:10,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 06:12:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-10 06:12:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 06:12:10,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,870 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,870 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash -484936157, now seen corresponding path program 3 times [2018-11-10 06:12:10,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:12:10,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 06:12:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:10,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:12:10,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:12:10,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:12:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:12:10,895 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 5 states. [2018-11-10 06:12:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,909 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-10 06:12:10,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:12:10,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 06:12:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,911 INFO L225 Difference]: With dead ends: 36 [2018-11-10 06:12:10,911 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 06:12:10,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:12:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 06:12:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 06:12:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 06:12:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-10 06:12:10,915 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-10 06:12:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,915 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-10 06:12:10,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:12:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-10 06:12:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 06:12:10,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:12:10,916 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-10 06:12:10,916 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 06:12:10,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2127789925, now seen corresponding path program 3 times [2018-11-10 06:12:10,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:12:10,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:12:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:12:10,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:12:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 06:12:10,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:12:10,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:12:10,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:12:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:12:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:12:10,947 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 5 states. [2018-11-10 06:12:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:12:10,969 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-10 06:12:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:12:10,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 06:12:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:12:10,970 INFO L225 Difference]: With dead ends: 35 [2018-11-10 06:12:10,971 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 06:12:10,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:12:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 06:12:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 06:12:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 06:12:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:12:10,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-10 06:12:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:12:10,972 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:12:10,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:12:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:12:10,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 06:12:10,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 06:12:11,045 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 06:12:11,045 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:12:11,045 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 06:12:11,046 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 20) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 20) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2018-11-10 06:12:11,046 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L421 ceAbstractionStarter]: At program point L15-5(lines 15 18) the Hoare annotation is: (let ((.cse0 (<= main_~i~0 10000))) (or (and .cse0 (<= (+ main_~j~0 1) main_~i~0) (<= main_~i~0 (+ main_~j~0 9999)) (<= 10000 main_~i~0)) (and (<= 2 main_~j~0) .cse0 (<= (+ main_~j~0 9997) main_~i~0)) (and (<= main_~j~0 (+ main_~i~0 1)) .cse0 (<= 3 main_~j~0)))) [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 20) the Hoare annotation is: true [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-10 06:12:11,047 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-10 06:12:11,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:12:11 BoogieIcfgContainer [2018-11-10 06:12:11,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:12:11,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:12:11,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:12:11,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:12:11,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:12:09" (3/4) ... [2018-11-10 06:12:11,059 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 06:12:11,063 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 06:12:11,063 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 06:12:11,066 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 06:12:11,067 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 06:12:11,067 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 06:12:11,094 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59fc1e6e-b0be-4bc9-a6f2-def03a316238/bin-2019/uautomizer/witness.graphml [2018-11-10 06:12:11,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:12:11,094 INFO L168 Benchmark]: Toolchain (without parser) took 2222.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:12:11,095 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:12:11,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.91 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:11,096 INFO L168 Benchmark]: Boogie Preprocessor took 18.23 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:12:11,096 INFO L168 Benchmark]: RCFGBuilder took 209.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:11,096 INFO L168 Benchmark]: TraceAbstraction took 1823.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.2 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:11,097 INFO L168 Benchmark]: Witness Printer took 37.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:11,098 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.91 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.23 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1823.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.2 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. * Witness Printer took 37.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 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: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((i <= 10000 && j + 1 <= i) && i <= j + 9999) && 10000 <= i) || ((2 <= j && i <= 10000) && j + 9997 <= i)) || ((j <= i + 1 && i <= 10000) && 3 <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. SAFE Result, 1.7s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 152 SDslu, 215 SDs, 0 SdLazy, 397 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=11, 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 46 HoareAnnotationTreeSize, 5 FomulaSimplifications, 58 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 22605 SizeOfPredicates, 1 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 86/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...