./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 32bit --witnessprinter.graph.data.programhash f3d619d2c1c3b5319c1ba41a41e084c9947cb440 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:28:59,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:28:59,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:28:59,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:28:59,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:28:59,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:28:59,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:28:59,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:28:59,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:28:59,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:28:59,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:28:59,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:28:59,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:28:59,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:28:59,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:28:59,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:28:59,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:28:59,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:28:59,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:28:59,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:28:59,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:28:59,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:28:59,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:28:59,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:28:59,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:28:59,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:28:59,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:28:59,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:28:59,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:28:59,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:28:59,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:28:59,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:28:59,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:28:59,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:28:59,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:28:59,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:28:59,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-11-10 04:28:59,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:28:59,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:28:59,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:28:59,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:28:59,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:28:59,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:28:59,534 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:28:59,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:28:59,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:28:59,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:28:59,535 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 04:28:59,536 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:28:59,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:28:59,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:28:59,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:28:59,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:28:59,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:28:59,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:28:59,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:28:59,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:28:59,537 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:28:59,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:28:59,537 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:28:59,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:28:59,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:28:59,538 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_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3d619d2c1c3b5319c1ba41a41e084c9947cb440 [2018-11-10 04:28:59,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:28:59,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:28:59,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:28:59,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:28:59,573 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:28:59,573 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 04:28:59,614 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/data/f72257fe9/09436a9f280b49a39f027256506e77a1/FLAG8cd5bfa3a [2018-11-10 04:28:59,956 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:28:59,956 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/sv-benchmarks/c/recursive/EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 04:28:59,960 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/data/f72257fe9/09436a9f280b49a39f027256506e77a1/FLAG8cd5bfa3a [2018-11-10 04:28:59,971 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/data/f72257fe9/09436a9f280b49a39f027256506e77a1 [2018-11-10 04:28:59,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:28:59,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 04:28:59,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:28:59,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:28:59,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:28:59,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:28:59" (1/1) ... [2018-11-10 04:28:59,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:59, skipping insertion in model container [2018-11-10 04:28:59,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:28:59" (1/1) ... [2018-11-10 04:28:59,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:28:59,998 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:29:00,105 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:29:00,108 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:29:00,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:29:00,127 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:29:00,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00 WrapperNode [2018-11-10 04:29:00,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:29:00,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:29:00,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:29:00,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:29:00,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... [2018-11-10 04:29:00,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:29:00,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:29:00,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:29:00,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:29:00,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:29:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:29:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2018-11-10 04:29:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2018-11-10 04:29:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:29:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 04:29:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 04:29:00,219 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2018-11-10 04:29:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2018-11-10 04:29:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:29:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:29:00,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:29:00,335 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:29:00,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:29:00 BoogieIcfgContainer [2018-11-10 04:29:00,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:29:00,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:29:00,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:29:00,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:29:00,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:28:59" (1/3) ... [2018-11-10 04:29:00,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2104596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:29:00, skipping insertion in model container [2018-11-10 04:29:00,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:29:00" (2/3) ... [2018-11-10 04:29:00,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2104596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:29:00, skipping insertion in model container [2018-11-10 04:29:00,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:29:00" (3/3) ... [2018-11-10 04:29:00,342 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd03_false-unreach-call_true-no-overflow_true-termination.c [2018-11-10 04:29:00,348 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:29:00,352 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-10 04:29:00,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-10 04:29:00,380 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:29:00,380 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:29:00,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:29:00,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:29:00,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:29:00,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:29:00,381 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:29:00,381 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:29:00,381 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:29:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-10 04:29:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 04:29:00,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:00,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:00,398 INFO L424 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:00,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1145500273, now seen corresponding path program 1 times [2018-11-10 04:29:00,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:00,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:00,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:00,519 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 04:29:00,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:29:00,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:29:00,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:29:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:29:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:29:00,535 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2018-11-10 04:29:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:00,630 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-10 04:29:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:29:00,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 04:29:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:00,638 INFO L225 Difference]: With dead ends: 53 [2018-11-10 04:29:00,638 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 04:29:00,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:29:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 04:29:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-10 04:29:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 04:29:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 04:29:00,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2018-11-10 04:29:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:00,664 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 04:29:00,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:29:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 04:29:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 04:29:00,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:00,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:00,665 INFO L424 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:00,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1150770052, now seen corresponding path program 1 times [2018-11-10 04:29:00,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:00,695 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 04:29:00,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:29:00,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:29:00,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:29:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:29:00,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:29:00,697 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-11-10 04:29:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:00,739 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-10 04:29:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:29:00,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 04:29:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:00,740 INFO L225 Difference]: With dead ends: 30 [2018-11-10 04:29:00,740 INFO L226 Difference]: Without dead ends: 29 [2018-11-10 04:29:00,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:29:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-10 04:29:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-10 04:29:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 04:29:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-10 04:29:00,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2018-11-10 04:29:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:00,745 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-10 04:29:00,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:29:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-10 04:29:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 04:29:00,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:00,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:00,746 INFO L424 AbstractCegarLoop]: === Iteration 3 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:00,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -663468774, now seen corresponding path program 1 times [2018-11-10 04:29:00,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:00,798 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 04:29:00,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:29:00,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:29:00,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:29:00,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:29:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:29:00,799 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 5 states. [2018-11-10 04:29:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:00,823 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-10 04:29:00,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:29:00,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 04:29:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:00,824 INFO L225 Difference]: With dead ends: 28 [2018-11-10 04:29:00,824 INFO L226 Difference]: Without dead ends: 27 [2018-11-10 04:29:00,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:29:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-10 04:29:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 04:29:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 04:29:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 04:29:00,828 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2018-11-10 04:29:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:00,828 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 04:29:00,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:29:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 04:29:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 04:29:00,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:00,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:00,830 INFO L424 AbstractCegarLoop]: === Iteration 4 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:00,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 907304545, now seen corresponding path program 1 times [2018-11-10 04:29:00,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:00,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:00,882 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 04:29:00,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:29:00,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:29:00,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:29:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:29:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:29:00,884 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-10 04:29:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:00,965 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-10 04:29:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:29:00,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-10 04:29:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:00,966 INFO L225 Difference]: With dead ends: 35 [2018-11-10 04:29:00,966 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 04:29:00,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:29:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 04:29:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-10 04:29:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 04:29:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-10 04:29:00,971 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 18 [2018-11-10 04:29:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:00,971 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-10 04:29:00,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:29:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-10 04:29:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:29:00,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:00,972 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:00,972 INFO L424 AbstractCegarLoop]: === Iteration 5 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:00,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2012308137, now seen corresponding path program 1 times [2018-11-10 04:29:00,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:00,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:29:01,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:29:01,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:29:01,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:29:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:29:01,010 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 5 states. [2018-11-10 04:29:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:01,042 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-10 04:29:01,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:29:01,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-10 04:29:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:01,043 INFO L225 Difference]: With dead ends: 33 [2018-11-10 04:29:01,043 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 04:29:01,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:29:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 04:29:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 04:29:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 04:29:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-10 04:29:01,048 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-11-10 04:29:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:01,048 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-10 04:29:01,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:29:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-10 04:29:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 04:29:01,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:01,049 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:01,049 INFO L424 AbstractCegarLoop]: === Iteration 6 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:01,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash 2042957236, now seen corresponding path program 1 times [2018-11-10 04:29:01,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:01,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,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 04:29:01,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:01,108 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:01,167 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 04:29:01,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:01,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 04:29:01,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:29:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:29:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:29:01,193 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2018-11-10 04:29:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:01,270 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-10 04:29:01,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:29:01,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-10 04:29:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:01,272 INFO L225 Difference]: With dead ends: 40 [2018-11-10 04:29:01,272 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 04:29:01,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:29:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 04:29:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-10 04:29:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 04:29:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-10 04:29:01,279 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 24 [2018-11-10 04:29:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:01,279 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-10 04:29:01,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:29:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-10 04:29:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 04:29:01,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:01,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:01,280 INFO L424 AbstractCegarLoop]: === Iteration 7 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:01,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1071972967, now seen corresponding path program 1 times [2018-11-10 04:29:01,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:01,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:01,373 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:01,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 04:29:01,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 04:29:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:29:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:29:01,430 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-11-10 04:29:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:01,555 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-10 04:29:01,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 04:29:01,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-10 04:29:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:01,557 INFO L225 Difference]: With dead ends: 46 [2018-11-10 04:29:01,557 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 04:29:01,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:29:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 04:29:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-10 04:29:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 04:29:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-10 04:29:01,564 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 30 [2018-11-10 04:29:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:01,564 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-10 04:29:01,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 04:29:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-10 04:29:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:29:01,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:01,567 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:01,567 INFO L424 AbstractCegarLoop]: === Iteration 8 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:01,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2020958956, now seen corresponding path program 2 times [2018-11-10 04:29:01,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:01,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:29:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:01,667 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:29:01,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:29:01,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:29:01,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-10 04:29:01,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 04:29:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 04:29:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-10 04:29:01,710 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 13 states. [2018-11-10 04:29:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:01,822 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-10 04:29:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 04:29:01,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-10 04:29:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:01,823 INFO L225 Difference]: With dead ends: 52 [2018-11-10 04:29:01,824 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 04:29:01,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-10 04:29:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 04:29:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-10 04:29:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 04:29:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-10 04:29:01,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 36 [2018-11-10 04:29:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:01,831 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-10 04:29:01,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 04:29:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-10 04:29:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:29:01,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:01,832 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:01,832 INFO L424 AbstractCegarLoop]: === Iteration 9 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:01,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash -19625775, now seen corresponding path program 2 times [2018-11-10 04:29:01,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:29:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:01,945 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:01,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:29:01,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:29:01,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:29:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:01,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:01,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-10 04:29:01,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 04:29:01,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 04:29:01,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:29:01,988 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 15 states. [2018-11-10 04:29:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:02,103 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-10 04:29:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 04:29:02,104 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-10 04:29:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:02,104 INFO L225 Difference]: With dead ends: 58 [2018-11-10 04:29:02,104 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 04:29:02,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-11-10 04:29:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 04:29:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-10 04:29:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 04:29:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-10 04:29:02,109 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 42 [2018-11-10 04:29:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:02,110 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-10 04:29:02,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 04:29:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-10 04:29:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 04:29:02,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:02,111 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:02,111 INFO L424 AbstractCegarLoop]: === Iteration 10 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:02,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1661492188, now seen corresponding path program 3 times [2018-11-10 04:29:02,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:02,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:02,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:29:02,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:02,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:02,232 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:29:02,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 04:29:02,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:29:02,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-10 04:29:02,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 04:29:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 04:29:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-10 04:29:02,314 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 17 states. [2018-11-10 04:29:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:02,440 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-10 04:29:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 04:29:02,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-11-10 04:29:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:02,440 INFO L225 Difference]: With dead ends: 64 [2018-11-10 04:29:02,440 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 04:29:02,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:29:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 04:29:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-10 04:29:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 04:29:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-10 04:29:02,446 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 48 [2018-11-10 04:29:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:02,446 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-10 04:29:02,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 04:29:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-10 04:29:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 04:29:02,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:02,447 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:02,447 INFO L424 AbstractCegarLoop]: === Iteration 11 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:02,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1094647817, now seen corresponding path program 3 times [2018-11-10 04:29:02,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:02,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:02,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:02,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:29:02,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:02,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:02,562 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/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 04:29:02,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:29:02,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 04:29:02,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:29:02,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-10 04:29:02,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 04:29:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 04:29:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-11-10 04:29:02,606 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 19 states. [2018-11-10 04:29:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:02,738 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-10 04:29:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 04:29:02,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-10 04:29:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:02,739 INFO L225 Difference]: With dead ends: 70 [2018-11-10 04:29:02,740 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 04:29:02,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-11-10 04:29:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 04:29:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-10 04:29:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 04:29:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-10 04:29:02,747 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 54 [2018-11-10 04:29:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:02,748 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-10 04:29:02,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 04:29:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-10 04:29:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 04:29:02,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:29:02,748 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:29:02,749 INFO L424 AbstractCegarLoop]: === Iteration 12 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:29:02,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:29:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2143932764, now seen corresponding path program 4 times [2018-11-10 04:29:02,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:29:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:29:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:02,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:29:02,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:29:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:29:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:29:02,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:29:02,899 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:29:02,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 04:29:02,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 04:29:02,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:29:02,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:29:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 04:29:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:29:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 24 [2018-11-10 04:29:03,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 04:29:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 04:29:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-11-10 04:29:03,013 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-11-10 04:29:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:29:03,075 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-10 04:29:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:29:03,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-11-10 04:29:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:29:03,076 INFO L225 Difference]: With dead ends: 68 [2018-11-10 04:29:03,076 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:29:03,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-11-10 04:29:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:29:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:29:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:29:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:29:03,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-11-10 04:29:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:29:03,078 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:29:03,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 04:29:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:29:03,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:29:03,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:29:03,253 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 04:29:03,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:29:03,253 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L421 ceAbstractionStarter]: At program point L32-2(line 32) the Hoare annotation is: (or (and (not (= isEven_~n 0)) (<= 0 isEven_~n) (<= isEven_~n 2147483647) (not (= isEven_~n 1))) (< 2147483647 |isEven_#in~n|) (< |isEven_#in~n| 0)) [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point L32-3(line 32) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L428 ceAbstractionStarter]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. [2018-11-10 04:29:03,254 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L421 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (or (< 2147483647 |isOdd_#in~n|) (and (<= isOdd_~n 2147483647) (<= 1 isOdd_~n)) (< |isOdd_#in~n| 1)) [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L428 ceAbstractionStarter]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:29:03,255 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:29:03,255 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:29:03,256 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 37 49) the Hoare annotation is: true [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 37 49) no Hoare annotation was computed. [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 37 49) no Hoare annotation was computed. [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 48) no Hoare annotation was computed. [2018-11-10 04:29:03,256 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= main_~n~0 2147483647)) [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2018-11-10 04:29:03,256 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2018-11-10 04:29:03,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:29:03 BoogieIcfgContainer [2018-11-10 04:29:03,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:29:03,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:29:03,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:29:03,261 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:29:03,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:29:00" (3/4) ... [2018-11-10 04:29:03,264 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:29:03,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:29:03,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isEven [2018-11-10 04:29:03,272 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isOdd [2018-11-10 04:29:03,273 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:29:03,276 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 04:29:03,277 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 04:29:03,277 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:29:03,312 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d589947a-0c01-4db5-b094-ef4bc6f7084c/bin-2019/uautomizer/witness.graphml [2018-11-10 04:29:03,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:29:03,313 INFO L168 Benchmark]: Toolchain (without parser) took 3339.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 959.1 MB in the beginning and 953.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 215.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:29:03,314 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:29:03,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:29:03,315 INFO L168 Benchmark]: Boogie Preprocessor took 17.23 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:29:03,315 INFO L168 Benchmark]: RCFGBuilder took 189.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:29:03,315 INFO L168 Benchmark]: TraceAbstraction took 2924.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 958.0 MB in the end (delta: 174.4 MB). Peak memory consumption was 237.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:29:03,316 INFO L168 Benchmark]: Witness Printer took 51.75 ms. Allocated memory is still 1.2 GB. Free memory was 958.0 MB in the beginning and 953.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:29:03,317 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.27 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.23 ms. Allocated memory is still 1.0 GB. Free memory is still 947.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 189.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2924.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 958.0 MB in the end (delta: 174.4 MB). Peak memory consumption was 237.3 MB. Max. memory is 11.5 GB. * Witness Printer took 51.75 ms. Allocated memory is still 1.2 GB. Free memory was 958.0 MB in the beginning and 953.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 4 error locations. SAFE Result, 2.8s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 296 SDslu, 1033 SDs, 0 SdLazy, 994 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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, 12 MinimizatonAttempts, 11 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 25 NumberOfFragments, 53 HoareAnnotationTreeSize, 25 FomulaSimplifications, 777 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 665 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 112776 SizeOfPredicates, 42 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 84/572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...