./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:09:07,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:09:07,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:09:07,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:09:07,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:09:07,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:09:07,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:09:07,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:09:07,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:09:07,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:09:07,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:09:07,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:09:07,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:09:07,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:09:07,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:09:07,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:09:07,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:09:07,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:09:07,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:09:07,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:09:07,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:09:07,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:09:07,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:09:07,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:09:07,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:09:07,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:09:07,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:09:07,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:09:07,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:09:07,264 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:09:07,264 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:09:07,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:09:07,265 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:09:07,265 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:09:07,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:09:07,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:09:07,266 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-10 04:09:07,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:09:07,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:09:07,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:09:07,274 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:09:07,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:09:07,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:09:07,274 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:09:07,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:09:07,274 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:09:07,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:09:07,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:09:07,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:09:07,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:09:07,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:09:07,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:09:07,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:09:07,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:09:07,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:09:07,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:09:07,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:09:07,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:09:07,277 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_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2018-11-10 04:09:07,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:09:07,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:09:07,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:09:07,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:09:07,316 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:09:07,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 04:09:07,359 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/data/700650ada/fbda7b10ee974b4c9526dfc48874c914/FLAG30078a3f1 [2018-11-10 04:09:07,754 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:09:07,754 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 04:09:07,758 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/data/700650ada/fbda7b10ee974b4c9526dfc48874c914/FLAG30078a3f1 [2018-11-10 04:09:07,767 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/data/700650ada/fbda7b10ee974b4c9526dfc48874c914 [2018-11-10 04:09:07,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:09:07,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 04:09:07,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:09:07,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:09:07,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:09:07,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e3325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07, skipping insertion in model container [2018-11-10 04:09:07,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:09:07,799 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:09:07,908 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:09:07,911 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:09:07,920 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:09:07,928 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:09:07,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07 WrapperNode [2018-11-10 04:09:07,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:09:07,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:09:07,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:09:07,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:09:07,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... [2018-11-10 04:09:07,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:09:07,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:09:07,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:09:07,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:09:07,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:09:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:09:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:09:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-10 04:09:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-10 04:09:08,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:09:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 04:09:08,015 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-10 04:09:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-10 04:09:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:09:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:09:08,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:09:08,137 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:09:08,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:09:08 BoogieIcfgContainer [2018-11-10 04:09:08,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:09:08,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:09:08,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:09:08,141 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:09:08,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:09:07" (1/3) ... [2018-11-10 04:09:08,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189d8081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:09:08, skipping insertion in model container [2018-11-10 04:09:08,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:09:07" (2/3) ... [2018-11-10 04:09:08,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189d8081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:09:08, skipping insertion in model container [2018-11-10 04:09:08,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:09:08" (3/3) ... [2018-11-10 04:09:08,144 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 04:09:08,153 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:09:08,158 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 04:09:08,170 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 04:09:08,187 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:09:08,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:09:08,188 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:09:08,188 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:09:08,188 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:09:08,188 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:09:08,188 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:09:08,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:09:08,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:09:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-10 04:09:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 04:09:08,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,211 INFO L424 AbstractCegarLoop]: === Iteration 1 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-10 04:09:08,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:09:08,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:09:08,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:09:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:09:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:08,347 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-10 04:09:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,407 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-10 04:09:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:09:08,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 04:09:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,414 INFO L225 Difference]: With dead ends: 49 [2018-11-10 04:09:08,415 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 04:09:08,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:09:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 04:09:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 04:09:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 04:09:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-10 04:09:08,444 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-11-10 04:09:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,445 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 04:09:08,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:09:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-10 04:09:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 04:09:08,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,446 INFO L424 AbstractCegarLoop]: === Iteration 2 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-10 04:09:08,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:09:08,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:09:08,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:09:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:09:08,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,468 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-11-10 04:09:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,484 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 04:09:08,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:09:08,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 04:09:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,486 INFO L225 Difference]: With dead ends: 45 [2018-11-10 04:09:08,486 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 04:09:08,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 04:09:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-10 04:09:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 04:09:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-10 04:09:08,493 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-11-10 04:09:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,494 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-10 04:09:08,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:09:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-10 04:09:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 04:09:08,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,495 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,495 INFO L424 AbstractCegarLoop]: === Iteration 3 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-11-10 04:09:08,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:09:08,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:09:08,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:09:08,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:09:08,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:08,535 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-10 04:09:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,612 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-10 04:09:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:09:08,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 04:09:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,613 INFO L225 Difference]: With dead ends: 66 [2018-11-10 04:09:08,614 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 04:09:08,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:09:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 04:09:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-10 04:09:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 04:09:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-10 04:09:08,624 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-11-10 04:09:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,625 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-10 04:09:08,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:09:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-10 04:09:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 04:09:08,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,626 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,626 INFO L424 AbstractCegarLoop]: === Iteration 4 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-11-10 04:09:08,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:09:08,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:09:08,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:09:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:09:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,650 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-11-10 04:09:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,665 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-10 04:09:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:09:08,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 04:09:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,666 INFO L225 Difference]: With dead ends: 62 [2018-11-10 04:09:08,666 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 04:09:08,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 04:09:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-10 04:09:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 04:09:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-10 04:09:08,675 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-11-10 04:09:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,675 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-10 04:09:08,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:09:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-10 04:09:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 04:09:08,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,676 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,677 INFO L424 AbstractCegarLoop]: === Iteration 5 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2128388042, now seen corresponding path program 1 times [2018-11-10 04:09:08,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:09:08,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:09:08,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:09:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:09:08,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,710 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-11-10 04:09:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,723 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-10 04:09:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:09:08,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 04:09:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,724 INFO L225 Difference]: With dead ends: 57 [2018-11-10 04:09:08,724 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 04:09:08,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 04:09:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 04:09:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 04:09:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-10 04:09:08,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 23 [2018-11-10 04:09:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,729 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-10 04:09:08,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:09:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-10 04:09:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:09:08,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,730 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,730 INFO L424 AbstractCegarLoop]: === Iteration 6 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-11-10 04:09:08,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:09:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:09:08,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:09:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:09:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:09:08,757 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-11-10 04:09:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,774 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-10 04:09:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:09:08,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 04:09:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,775 INFO L225 Difference]: With dead ends: 64 [2018-11-10 04:09:08,775 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 04:09:08,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:09:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 04:09:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-10 04:09:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 04:09:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-11-10 04:09:08,781 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-11-10 04:09:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,782 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-10 04:09:08,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:09:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-11-10 04:09:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 04:09:08,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,783 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,783 INFO L424 AbstractCegarLoop]: === Iteration 7 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-11-10 04:09:08,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:09:08,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:09:08,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:09:08,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:09:08,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,797 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-11-10 04:09:08,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,805 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-10 04:09:08,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:09:08,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 04:09:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,806 INFO L225 Difference]: With dead ends: 61 [2018-11-10 04:09:08,806 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 04:09:08,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 04:09:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-10 04:09:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 04:09:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-10 04:09:08,811 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-11-10 04:09:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,811 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-10 04:09:08,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:09:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-10 04:09:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 04:09:08,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,812 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,813 INFO L424 AbstractCegarLoop]: === Iteration 8 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-11-10 04:09:08,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:09:08,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:09:08,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:09:08,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:09:08,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:09:08,851 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-11-10 04:09:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:08,869 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-10 04:09:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:09:08,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 04:09:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:08,871 INFO L225 Difference]: With dead ends: 83 [2018-11-10 04:09:08,871 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 04:09:08,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:09:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 04:09:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-11-10 04:09:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 04:09:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-10 04:09:08,879 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-11-10 04:09:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:08,880 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-10 04:09:08,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:09:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-10 04:09:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 04:09:08,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:08,880 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:08,881 INFO L424 AbstractCegarLoop]: === Iteration 9 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:08,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-11-10 04:09:08,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:08,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:08,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:09:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:09:08,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:09:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:09:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:08,918 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-11-10 04:09:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,006 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-10 04:09:09,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:09:09,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-10 04:09:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,007 INFO L225 Difference]: With dead ends: 93 [2018-11-10 04:09:09,007 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 04:09:09,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:09:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 04:09:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-10 04:09:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 04:09:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-11-10 04:09:09,016 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-11-10 04:09:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,016 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-11-10 04:09:09,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:09:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-10 04:09:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 04:09:09,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,017 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,018 INFO L424 AbstractCegarLoop]: === Iteration 10 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1290914449, now seen corresponding path program 1 times [2018-11-10 04:09:09,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 04:09:09,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:09,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:09:09,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:09:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:09:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:09,043 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-11-10 04:09:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,112 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-11-10 04:09:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:09:09,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 04:09:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,113 INFO L225 Difference]: With dead ends: 92 [2018-11-10 04:09:09,113 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 04:09:09,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:09:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 04:09:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-10 04:09:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 04:09:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-10 04:09:09,121 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 39 [2018-11-10 04:09:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,121 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-10 04:09:09,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:09:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-10 04:09:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:09:09,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,123 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,123 INFO L424 AbstractCegarLoop]: === Iteration 11 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-11-10 04:09:09,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 04:09:09,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:09,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:09:09,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:09:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:09:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:09:09,150 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-10 04:09:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,170 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-11-10 04:09:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:09:09,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-10 04:09:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,172 INFO L225 Difference]: With dead ends: 98 [2018-11-10 04:09:09,173 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 04:09:09,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:09:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 04:09:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-10 04:09:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 04:09:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-11-10 04:09:09,182 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-11-10 04:09:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,182 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-11-10 04:09:09,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:09:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-10 04:09:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 04:09:09,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,184 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,184 INFO L424 AbstractCegarLoop]: === Iteration 12 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-11-10 04:09:09,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:09:09,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:09,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:09:09,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:09:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:09:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:09,211 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-11-10 04:09:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,235 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-10 04:09:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:09:09,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 04:09:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,237 INFO L225 Difference]: With dead ends: 94 [2018-11-10 04:09:09,237 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 04:09:09,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:09:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 04:09:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-10 04:09:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 04:09:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-11-10 04:09:09,249 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-11-10 04:09:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,249 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-10 04:09:09,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:09:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-11-10 04:09:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 04:09:09,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,252 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,252 INFO L424 AbstractCegarLoop]: === Iteration 13 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1633453199, now seen corresponding path program 1 times [2018-11-10 04:09:09,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 04:09:09,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:09,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:09:09,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:09:09,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:09:09,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:09,313 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-11-10 04:09:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,343 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-11-10 04:09:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:09:09,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-10 04:09:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,344 INFO L225 Difference]: With dead ends: 93 [2018-11-10 04:09:09,344 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 04:09:09,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:09:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 04:09:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2018-11-10 04:09:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 04:09:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2018-11-10 04:09:09,351 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 58 [2018-11-10 04:09:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,351 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2018-11-10 04:09:09,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:09:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2018-11-10 04:09:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 04:09:09,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,352 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,353 INFO L424 AbstractCegarLoop]: === Iteration 14 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,353 INFO L82 PathProgramCache]: Analyzing trace with hash -887062779, now seen corresponding path program 1 times [2018-11-10 04:09:09,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 04:09:09,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:09:09,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:09:09,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:09:09,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:09:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:09,395 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 5 states. [2018-11-10 04:09:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,441 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-10 04:09:09,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:09:09,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-10 04:09:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,442 INFO L225 Difference]: With dead ends: 81 [2018-11-10 04:09:09,442 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 04:09:09,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:09:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 04:09:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-10 04:09:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 04:09:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-10 04:09:09,449 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 53 [2018-11-10 04:09:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,450 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-10 04:09:09,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:09:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-11-10 04:09:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 04:09:09,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,451 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,452 INFO L424 AbstractCegarLoop]: === Iteration 15 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 375918826, now seen corresponding path program 1 times [2018-11-10 04:09:09,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 04:09:09,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:09:09,499 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:09:09,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:09:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-10 04:09:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:09:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-10 04:09:09,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:09:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:09:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:09:09,572 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 6 states. [2018-11-10 04:09:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,604 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2018-11-10 04:09:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:09:09,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-10 04:09:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,605 INFO L225 Difference]: With dead ends: 154 [2018-11-10 04:09:09,606 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 04:09:09,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:09:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 04:09:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-11-10 04:09:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 04:09:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-11-10 04:09:09,616 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 71 [2018-11-10 04:09:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,616 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-11-10 04:09:09,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:09:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-10 04:09:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 04:09:09,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:09:09,618 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:09:09,619 INFO L424 AbstractCegarLoop]: === Iteration 16 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 04:09:09,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:09:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash -530823221, now seen corresponding path program 1 times [2018-11-10 04:09:09,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:09:09,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:09:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:09:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 04:09:09,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:09:09,685 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:09:09,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:09:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:09:09,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:09:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 04:09:09,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:09:09,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2018-11-10 04:09:09,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 04:09:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:09:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:09:09,802 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 11 states. [2018-11-10 04:09:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:09:09,880 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-10 04:09:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 04:09:09,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2018-11-10 04:09:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:09:09,881 INFO L225 Difference]: With dead ends: 97 [2018-11-10 04:09:09,881 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:09:09,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:09:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:09:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:09:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:09:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:09:09,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-11-10 04:09:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:09:09,883 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:09:09,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 04:09:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:09:09,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:09:09,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:09:09,979 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 04:09:09,979 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:09:09,979 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 04:09:09,979 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,979 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,980 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,981 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,982 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (<= |rec2_#t~ret3| 0)) (< 2147483647 |rec2_#in~j|)) [2018-11-10 04:09:09,982 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 04:09:09,983 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:09:09,983 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:09:09,983 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:09:09,983 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-10 04:09:09,984 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-10 04:09:09,984 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-10 04:09:09,984 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-10 04:09:09,984 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-10 04:09:09,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:09:09 BoogieIcfgContainer [2018-11-10 04:09:09,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:09:09,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:09:09,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:09:09,987 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:09:09,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:09:08" (3/4) ... [2018-11-10 04:09:09,991 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:09:09,996 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:09:09,996 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-10 04:09:09,996 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-10 04:09:09,997 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:09:10,000 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 04:09:10,000 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 04:09:10,000 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:09:10,030 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e37f0b33-4e3e-47e6-9e56-ff53c2850d47/bin-2019/uautomizer/witness.graphml [2018-11-10 04:09:10,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:09:10,030 INFO L168 Benchmark]: Toolchain (without parser) took 2260.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -110.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:10,032 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:09:10,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:10,033 INFO L168 Benchmark]: Boogie Preprocessor took 15.20 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:09:10,033 INFO L168 Benchmark]: RCFGBuilder took 193.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:10,033 INFO L168 Benchmark]: TraceAbstraction took 1847.68 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:10,034 INFO L168 Benchmark]: Witness Printer took 43.01 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:09:10,035 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.20 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1847.68 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * Witness Printer took 43.01 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 1.8s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 663 SDtfs, 198 SDslu, 1356 SDs, 0 SdLazy, 362 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 61 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 99 PreInvPairs, 103 NumberOfFragments, 48 HoareAnnotationTreeSize, 99 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 56026 SizeOfPredicates, 3 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 662/711 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...