./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/EvenOdd01_true-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_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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 bec5669c6fe02e51518958076fea4487ada345cf .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:41:25,107 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:41:25,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:41:25,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:41:25,119 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:41:25,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:41:25,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:41:25,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:41:25,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:41:25,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:41:25,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:41:25,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:41:25,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:41:25,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:41:25,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:41:25,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:41:25,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:41:25,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:41:25,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:41:25,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:41:25,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:41:25,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:41:25,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:41:25,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:41:25,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:41:25,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:41:25,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:41:25,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:41:25,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:41:25,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:41:25,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:41:25,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:41:25,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:41:25,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:41:25,145 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:41:25,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:41:25,145 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2018-10-27 05:41:25,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:41:25,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:41:25,158 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:41:25,158 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 05:41:25,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 05:41:25,158 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 05:41:25,159 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 05:41:25,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:41:25,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:41:25,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:41:25,161 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:41:25,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 05:41:25,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:41:25,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:41:25,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:41:25,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:41:25,162 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:41:25,162 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:41:25,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:41:25,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:41:25,162 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:41:25,162 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:41:25,162 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 05:41:25,163 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:41:25,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:41:25,163 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_a535f957-a36f-42f2-9dbf-66c35a56b57c/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 -> bec5669c6fe02e51518958076fea4487ada345cf [2018-10-27 05:41:25,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:41:25,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:41:25,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:41:25,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:41:25,202 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:41:25,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2018-10-27 05:41:25,248 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/data/d9ded8b1e/5ca52c99cf3749db859a2cdd2826ae47/FLAG9b1f8d0ef [2018-10-27 05:41:25,622 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:41:25,623 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/sv-benchmarks/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2018-10-27 05:41:25,629 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/data/d9ded8b1e/5ca52c99cf3749db859a2cdd2826ae47/FLAG9b1f8d0ef [2018-10-27 05:41:25,641 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/data/d9ded8b1e/5ca52c99cf3749db859a2cdd2826ae47 [2018-10-27 05:41:25,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:41:25,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 05:41:25,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:41:25,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:41:25,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:41:25,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa72dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25, skipping insertion in model container [2018-10-27 05:41:25,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:41:25,684 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:41:25,798 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:41:25,800 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:41:25,811 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:41:25,819 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:41:25,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25 WrapperNode [2018-10-27 05:41:25,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:41:25,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:41:25,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:41:25,820 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:41:25,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... [2018-10-27 05:41:25,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:41:25,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:41:25,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:41:25,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:41:25,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:25,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:41:25,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:41:25,948 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2018-10-27 05:41:25,948 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2018-10-27 05:41:25,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:41:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 05:41:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 05:41:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2018-10-27 05:41:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2018-10-27 05:41:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:41:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:41:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:41:26,362 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:41:26,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:41:26 BoogieIcfgContainer [2018-10-27 05:41:26,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:41:26,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:41:26,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:41:26,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:41:26,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:41:25" (1/3) ... [2018-10-27 05:41:26,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282ea602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:41:26, skipping insertion in model container [2018-10-27 05:41:26,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:41:25" (2/3) ... [2018-10-27 05:41:26,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282ea602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:41:26, skipping insertion in model container [2018-10-27 05:41:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:41:26" (3/3) ... [2018-10-27 05:41:26,370 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2018-10-27 05:41:26,379 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:41:26,387 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-27 05:41:26,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-10-27 05:41:26,426 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 05:41:26,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:41:26,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:41:26,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:41:26,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:41:26,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:41:26,427 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:41:26,427 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:41:26,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:41:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-27 05:41:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-27 05:41:26,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:26,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:41:26,457 INFO L424 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:26,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1145007729, now seen corresponding path program 1 times [2018-10-27 05:41:26,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:26,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:26,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:26,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:41:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:41:26,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:41:26,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:41:26,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:41:26,776 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2018-10-27 05:41:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:26,936 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-10-27 05:41:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:41:26,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-10-27 05:41:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:26,945 INFO L225 Difference]: With dead ends: 53 [2018-10-27 05:41:26,945 INFO L226 Difference]: Without dead ends: 30 [2018-10-27 05:41:26,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:41:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-27 05:41:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-27 05:41:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 05:41:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-27 05:41:26,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2018-10-27 05:41:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:26,978 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-27 05:41:26,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:41:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-27 05:41:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-27 05:41:26,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:26,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:41:26,979 INFO L424 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:26,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1135501172, now seen corresponding path program 1 times [2018-10-27 05:41:26,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:26,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:26,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:26,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:26,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:27,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:41:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:41:27,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:41:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:41:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:41:27,071 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-10-27 05:41:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:27,228 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-27 05:41:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:41:27,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-27 05:41:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:27,229 INFO L225 Difference]: With dead ends: 30 [2018-10-27 05:41:27,229 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 05:41:27,230 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-10-27 05:41:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 05:41:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-10-27 05:41:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 05:41:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-27 05:41:27,234 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2018-10-27 05:41:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:27,234 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-27 05:41:27,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:41:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-27 05:41:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 05:41:27,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:27,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:41:27,237 INFO L424 AbstractCegarLoop]: === Iteration 3 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:27,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1227554316, now seen corresponding path program 1 times [2018-10-27 05:41:27,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:27,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:27,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:41:27,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:41:27,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:41:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:41:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:41:27,313 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 5 states. [2018-10-27 05:41:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:27,357 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-27 05:41:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:41:27,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-27 05:41:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:27,358 INFO L225 Difference]: With dead ends: 28 [2018-10-27 05:41:27,358 INFO L226 Difference]: Without dead ends: 27 [2018-10-27 05:41:27,358 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-10-27 05:41:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-27 05:41:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-27 05:41:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 05:41:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-27 05:41:27,364 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2018-10-27 05:41:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:27,364 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-27 05:41:27,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:41:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-27 05:41:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 05:41:27,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:27,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:41:27,365 INFO L424 AbstractCegarLoop]: === Iteration 4 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:27,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash -600521825, now seen corresponding path program 1 times [2018-10-27 05:41:27,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:27,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:27,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:27,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:27,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:41:27,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:41:27,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:41:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:41:27,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:41:27,465 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-10-27 05:41:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:27,622 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-27 05:41:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:41:27,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-27 05:41:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:27,624 INFO L225 Difference]: With dead ends: 35 [2018-10-27 05:41:27,624 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 05:41:27,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:41:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 05:41:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-27 05:41:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 05:41:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-27 05:41:27,629 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 18 [2018-10-27 05:41:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:27,629 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-27 05:41:27,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:41:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-27 05:41:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 05:41:27,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:27,630 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-10-27 05:41:27,630 INFO L424 AbstractCegarLoop]: === Iteration 5 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:27,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:27,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2031952855, now seen corresponding path program 1 times [2018-10-27 05:41:27,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:27,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:27,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:27,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:27,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:41:27,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:41:27,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:41:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:41:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:41:27,678 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 5 states. [2018-10-27 05:41:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:27,748 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-27 05:41:27,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:41:27,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-27 05:41:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:27,749 INFO L225 Difference]: With dead ends: 33 [2018-10-27 05:41:27,750 INFO L226 Difference]: Without dead ends: 32 [2018-10-27 05:41:27,751 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-10-27 05:41:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-27 05:41:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-27 05:41:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 05:41:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-27 05:41:27,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-10-27 05:41:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:27,757 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-27 05:41:27,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:41:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-27 05:41:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 05:41:27,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:27,758 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-10-27 05:41:27,758 INFO L424 AbstractCegarLoop]: === Iteration 6 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:27,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1433970876, now seen corresponding path program 1 times [2018-10-27 05:41:27,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:28,069 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:28,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:28,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:28,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-10-27 05:41:28,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:28,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-27 05:41:28,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 05:41:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 05:41:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:41:28,132 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2018-10-27 05:41:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:28,291 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-27 05:41:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:41:28,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-27 05:41:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:28,292 INFO L225 Difference]: With dead ends: 40 [2018-10-27 05:41:28,292 INFO L226 Difference]: Without dead ends: 39 [2018-10-27 05:41:28,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-27 05:41:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-27 05:41:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-27 05:41:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-27 05:41:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-27 05:41:28,298 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 24 [2018-10-27 05:41:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:28,298 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-27 05:41:28,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 05:41:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-27 05:41:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 05:41:28,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:28,299 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-10-27 05:41:28,300 INFO L424 AbstractCegarLoop]: === Iteration 7 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:28,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1111789655, now seen corresponding path program 1 times [2018-10-27 05:41:28,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:28,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:28,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:28,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:28,460 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:28,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:28,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:28,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:28,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-27 05:41:28,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 05:41:28,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 05:41:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-27 05:41:28,515 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-10-27 05:41:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:28,691 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-27 05:41:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 05:41:28,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-27 05:41:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:28,692 INFO L225 Difference]: With dead ends: 46 [2018-10-27 05:41:28,692 INFO L226 Difference]: Without dead ends: 45 [2018-10-27 05:41:28,693 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-10-27 05:41:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-27 05:41:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-27 05:41:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 05:41:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-27 05:41:28,700 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 30 [2018-10-27 05:41:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:28,700 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-27 05:41:28,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 05:41:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-27 05:41:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 05:41:28,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:28,701 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-10-27 05:41:28,702 INFO L424 AbstractCegarLoop]: === Iteration 8 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:28,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2046248452, now seen corresponding path program 2 times [2018-10-27 05:41:28,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:28,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:28,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:41:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:28,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:28,900 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:28,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 05:41:28,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 05:41:28,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:41:28,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:28,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:28,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-27 05:41:28,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 05:41:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 05:41:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-27 05:41:28,949 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 13 states. [2018-10-27 05:41:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:29,265 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-27 05:41:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 05:41:29,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-10-27 05:41:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:29,268 INFO L225 Difference]: With dead ends: 52 [2018-10-27 05:41:29,268 INFO L226 Difference]: Without dead ends: 51 [2018-10-27 05:41:29,268 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-10-27 05:41:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-27 05:41:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-27 05:41:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 05:41:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-27 05:41:29,274 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 36 [2018-10-27 05:41:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:29,275 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-27 05:41:29,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 05:41:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-27 05:41:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 05:41:29,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:29,276 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-10-27 05:41:29,276 INFO L424 AbstractCegarLoop]: === Iteration 9 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:29,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash -517011185, now seen corresponding path program 2 times [2018-10-27 05:41:29,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:29,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:41:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:29,391 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 05:41:29,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 05:41:29,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:41:29,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:29,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:29,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-27 05:41:29,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 05:41:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 05:41:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-27 05:41:29,460 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 15 states. [2018-10-27 05:41:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:29,691 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-27 05:41:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 05:41:29,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-10-27 05:41:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:29,692 INFO L225 Difference]: With dead ends: 58 [2018-10-27 05:41:29,692 INFO L226 Difference]: Without dead ends: 57 [2018-10-27 05:41:29,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-10-27 05:41:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-27 05:41:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-27 05:41:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 05:41:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-27 05:41:29,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 42 [2018-10-27 05:41:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:29,703 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-27 05:41:29,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 05:41:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-27 05:41:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 05:41:29,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:29,704 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-10-27 05:41:29,704 INFO L424 AbstractCegarLoop]: === Iteration 10 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:29,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1095513932, now seen corresponding path program 3 times [2018-10-27 05:41:29,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:29,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:29,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:29,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:41:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:29,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:29,881 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:29,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:41:29,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 05:41:29,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:41:29,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:30,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:30,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-27 05:41:30,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 05:41:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 05:41:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-10-27 05:41:30,007 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 17 states. [2018-10-27 05:41:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:30,193 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-27 05:41:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 05:41:30,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-10-27 05:41:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:30,194 INFO L225 Difference]: With dead ends: 64 [2018-10-27 05:41:30,194 INFO L226 Difference]: Without dead ends: 63 [2018-10-27 05:41:30,194 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-10-27 05:41:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-27 05:41:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-27 05:41:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-27 05:41:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-27 05:41:30,200 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 48 [2018-10-27 05:41:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:30,200 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-27 05:41:30,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 05:41:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-27 05:41:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 05:41:30,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:30,201 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-10-27 05:41:30,201 INFO L424 AbstractCegarLoop]: === Iteration 11 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:30,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:30,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1246899655, now seen corresponding path program 3 times [2018-10-27 05:41:30,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:30,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:30,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:30,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:41:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:30,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:30,353 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 05:41:30,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 05:41:30,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:41:30,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:30,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:30,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-27 05:41:30,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 05:41:30,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 05:41:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-10-27 05:41:30,402 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 19 states. [2018-10-27 05:41:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:30,602 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-27 05:41:30,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 05:41:30,603 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-10-27 05:41:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:30,603 INFO L225 Difference]: With dead ends: 70 [2018-10-27 05:41:30,603 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 05:41:30,604 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-10-27 05:41:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 05:41:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-27 05:41:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 05:41:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-27 05:41:30,611 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 54 [2018-10-27 05:41:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:30,612 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-27 05:41:30,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 05:41:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-27 05:41:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 05:41:30,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:41:30,613 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-10-27 05:41:30,613 INFO L424 AbstractCegarLoop]: === Iteration 12 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:41:30,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:41:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash -412712084, now seen corresponding path program 4 times [2018-10-27 05:41:30,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:41:30,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:41:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:30,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 05:41:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:41:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:41:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:41:30,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:41:30,911 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/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-10-27 05:41:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 05:41:30,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 05:41:30,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 05:41:30,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:41:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-27 05:41:31,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:41:31,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 24 [2018-10-27 05:41:31,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 05:41:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 05:41:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-10-27 05:41:31,071 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-10-27 05:41:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:41:31,159 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-27 05:41:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 05:41:31,160 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-10-27 05:41:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:41:31,160 INFO L225 Difference]: With dead ends: 68 [2018-10-27 05:41:31,161 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:41:31,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-10-27 05:41:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:41:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:41:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:41:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:41:31,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-10-27 05:41:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:41:31,163 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:41:31,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 05:41:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:41:31,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:41:31,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:41:31,719 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2018-10-27 05:41:31,896 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 12 [2018-10-27 05:41:31,902 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:41:31,902 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:41:31,902 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-10-27 05:41:31,902 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L421 ceAbstractionStarter]: At program point L32-2(line 32) the Hoare annotation is: (or (and (<= 1 isEven_~n) (<= isEven_~n 2147483647)) (< |isEven_#in~n| 1) (< 2147483647 |isEven_#in~n|)) [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point L32-3(line 32) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L428 ceAbstractionStarter]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-10-27 05:41:31,903 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L421 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (or (< 2147483647 |isOdd_#in~n|) (and (not (= isOdd_~n 0)) (<= isOdd_~n 2147483647) (<= 0 isOdd_~n) (not (= isOdd_~n 1))) (< |isOdd_#in~n| 0)) [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L428 ceAbstractionStarter]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:41:31,904 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:41:31,904 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:41:31,904 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:41:31,905 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 37 49) the Hoare annotation is: true [2018-10-27 05:41:31,905 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 37 49) no Hoare annotation was computed. [2018-10-27 05:41:31,905 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-10-27 05:41:31,905 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 37 49) no Hoare annotation was computed. [2018-10-27 05:41:31,905 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 48) no Hoare annotation was computed. [2018-10-27 05:41:31,905 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= main_~n~0 2147483647)) [2018-10-27 05:41:31,905 INFO L425 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2018-10-27 05:41:31,905 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2018-10-27 05:41:31,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:41:31 BoogieIcfgContainer [2018-10-27 05:41:31,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:41:31,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:41:31,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:41:31,910 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:41:31,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:41:26" (3/4) ... [2018-10-27 05:41:31,913 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:41:31,918 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:41:31,918 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isEven [2018-10-27 05:41:31,918 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isOdd [2018-10-27 05:41:31,919 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:41:31,923 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-27 05:41:31,923 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 05:41:31,924 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:41:31,963 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a535f957-a36f-42f2-9dbf-66c35a56b57c/bin-2019/uautomizer/witness.graphml [2018-10-27 05:41:31,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:41:31,964 INFO L168 Benchmark]: Toolchain (without parser) took 6316.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:41:31,964 INFO L168 Benchmark]: CDTParser took 0.15 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-10-27 05:41:31,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.73 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-10-27 05:41:31,965 INFO L168 Benchmark]: Boogie Preprocessor took 22.23 ms. Allocated memory is still 1.0 GB. Free memory is still 948.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:41:31,965 INFO L168 Benchmark]: RCFGBuilder took 520.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-10-27 05:41:31,965 INFO L168 Benchmark]: TraceAbstraction took 5545.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-10-27 05:41:31,966 INFO L168 Benchmark]: Witness Printer took 53.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-10-27 05:41:31,970 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.73 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 948.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.23 ms. Allocated memory is still 1.0 GB. Free memory is still 948.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 520.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5545.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -18.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Witness Printer took 53.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 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, 5.4s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 296 SDslu, 1033 SDs, 0 SdLazy, 994 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.2s 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, 824 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 666 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s 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...