./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/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_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/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-0cd3be1 [2018-11-28 12:31:34,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:31:34,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:31:34,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:31:34,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:31:34,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:31:34,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:31:34,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:31:34,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:31:34,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:31:34,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:31:34,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:31:34,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:31:34,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:31:34,401 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:31:34,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:31:34,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:31:34,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:31:34,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:31:34,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:31:34,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:31:34,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:31:34,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:31:34,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:31:34,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:31:34,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:31:34,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:31:34,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:31:34,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:31:34,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:31:34,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:31:34,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:31:34,413 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:31:34,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:31:34,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:31:34,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:31:34,414 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 12:31:34,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:31:34,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:31:34,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:31:34,423 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:31:34,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:31:34,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:31:34,424 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:31:34,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:31:34,424 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:31:34,424 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:31:34,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:31:34,425 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:31:34,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:31:34,425 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:31:34,425 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 12:31:34,425 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:31:34,425 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:31:34,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:31:34,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:31:34,426 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:31:34,426 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:31:34,426 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:31:34,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:31:34,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:31:34,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:31:34,427 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:31:34,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:31:34,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:31:34,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:31:34,427 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_fc2ce999-c306-44a4-9950-261a89ff01fb/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-28 12:31:34,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:31:34,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:31:34,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:31:34,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:31:34,465 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:31:34,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 12:31:34,511 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/data/aa67784f6/456b02cfe66f4ae7a774ba42184e3858/FLAGe63fc8453 [2018-11-28 12:31:34,810 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:31:34,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 12:31:34,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/data/aa67784f6/456b02cfe66f4ae7a774ba42184e3858/FLAGe63fc8453 [2018-11-28 12:31:34,822 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/data/aa67784f6/456b02cfe66f4ae7a774ba42184e3858 [2018-11-28 12:31:34,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:31:34,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:31:34,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:31:34,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:31:34,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:31:34,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c58c795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34, skipping insertion in model container [2018-11-28 12:31:34,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:31:34,844 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:31:34,929 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:31:34,931 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:31:34,941 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:31:34,950 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:31:34,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34 WrapperNode [2018-11-28 12:31:34,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:31:34,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:31:34,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:31:34,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:31:34,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:31:34,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:31:34,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:31:34,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:31:34,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... [2018-11-28 12:31:34,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:31:34,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:31:34,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:31:34,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:31:34,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/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-28 12:31:35,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:31:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:31:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-28 12:31:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-28 12:31:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-28 12:31:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-28 12:31:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:31:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:31:35,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:31:35,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:31:35,246 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:31:35,246 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 12:31:35,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:31:35 BoogieIcfgContainer [2018-11-28 12:31:35,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:31:35,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:31:35,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:31:35,252 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:31:35,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:31:34" (1/3) ... [2018-11-28 12:31:35,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c03d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:31:35, skipping insertion in model container [2018-11-28 12:31:35,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:34" (2/3) ... [2018-11-28 12:31:35,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c03d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:31:35, skipping insertion in model container [2018-11-28 12:31:35,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:31:35" (3/3) ... [2018-11-28 12:31:35,254 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 12:31:35,260 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:31:35,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-28 12:31:35,277 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-28 12:31:35,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:31:35,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:31:35,304 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:31:35,304 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:31:35,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:31:35,304 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:31:35,305 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:31:35,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:31:35,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:31:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 12:31:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 12:31:35,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:31:35,329 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-28 12:31:35,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,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-28 12:31:35,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:35,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:31:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:31:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:31:35,479 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-28 12:31:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,546 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-28 12:31:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:31:35,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 12:31:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,554 INFO L225 Difference]: With dead ends: 49 [2018-11-28 12:31:35,554 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 12:31:35,556 INFO L631 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-28 12:31:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 12:31:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 12:31:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 12:31:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 12:31:35,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-11-28 12:31:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,586 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 12:31:35,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:31:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 12:31:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:31:35,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:31:35,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-28 12:31:35,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,609 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-28 12:31:35,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:31:35,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:31:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:31:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:31:35,611 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-11-28 12:31:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,627 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-28 12:31:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:31:35,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 12:31:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,630 INFO L225 Difference]: With dead ends: 45 [2018-11-28 12:31:35,631 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:31:35,632 INFO L631 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-28 12:31:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:31:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-28 12:31:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 12:31:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-28 12:31:35,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-11-28 12:31:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,639 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-28 12:31:35,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:31:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-28 12:31:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:31:35,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,640 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:31:35,640 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-11-28 12:31:35,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,682 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-28 12:31:35,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:35,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:31:35,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:31:35,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:31:35,684 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-28 12:31:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,772 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-28 12:31:35,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:31:35,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 12:31:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,773 INFO L225 Difference]: With dead ends: 66 [2018-11-28 12:31:35,773 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 12:31:35,773 INFO L631 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-28 12:31:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 12:31:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-28 12:31:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 12:31:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-28 12:31:35,782 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-11-28 12:31:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,782 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-28 12:31:35,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:31:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-28 12:31:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:31:35,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,783 INFO L402 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-28 12:31:35,783 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-11-28 12:31:35,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,804 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-28 12:31:35,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:31:35,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:31:35,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:31:35,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:31:35,805 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-11-28 12:31:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,816 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-28 12:31:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:31:35,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:31:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,817 INFO L225 Difference]: With dead ends: 62 [2018-11-28 12:31:35,817 INFO L226 Difference]: Without dead ends: 61 [2018-11-28 12:31:35,818 INFO L631 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-28 12:31:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-28 12:31:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-28 12:31:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-28 12:31:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-28 12:31:35,824 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-11-28 12:31:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,824 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-28 12:31:35,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:31:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-28 12:31:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:31:35,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,825 INFO L402 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-28 12:31:35,825 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2128388042, now seen corresponding path program 1 times [2018-11-28 12:31:35,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,849 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-28 12:31:35,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:31:35,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:31:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:31:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:31:35,850 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-11-28 12:31:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,863 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-28 12:31:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:31:35,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:31:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,865 INFO L225 Difference]: With dead ends: 57 [2018-11-28 12:31:35,865 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 12:31:35,865 INFO L631 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-28 12:31:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 12:31:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-28 12:31:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 12:31:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-28 12:31:35,870 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 23 [2018-11-28 12:31:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,870 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-28 12:31:35,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:31:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-28 12:31:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:31:35,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,871 INFO L402 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-28 12:31:35,872 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-11-28 12:31:35,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,912 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-28 12:31:35,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:31:35,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:31:35,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:31:35,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:31:35,913 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-11-28 12:31:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,937 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-28 12:31:35,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:31:35,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-28 12:31:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,938 INFO L225 Difference]: With dead ends: 64 [2018-11-28 12:31:35,939 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 12:31:35,939 INFO L631 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-28 12:31:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 12:31:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-28 12:31:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 12:31:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-11-28 12:31:35,945 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-11-28 12:31:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,945 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-28 12:31:35,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:31:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-11-28 12:31:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:31:35,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,946 INFO L402 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-28 12:31:35,947 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-11-28 12:31:35,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:35,967 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-28 12:31:35,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:35,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:31:35,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:31:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:31:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:31:35,968 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-11-28 12:31:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:35,978 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-28 12:31:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:31:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:31:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:35,979 INFO L225 Difference]: With dead ends: 61 [2018-11-28 12:31:35,979 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 12:31:35,979 INFO L631 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-28 12:31:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 12:31:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 12:31:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 12:31:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-28 12:31:35,984 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-11-28 12:31:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:35,984 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-28 12:31:35,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:31:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-28 12:31:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:31:35,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:35,985 INFO L402 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-28 12:31:35,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:35,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-11-28 12:31:35,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:35,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:35,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:35,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,007 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-28 12:31:36,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:31:36,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:31:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:31:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:31:36,008 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-11-28 12:31:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,026 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-28 12:31:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:31:36,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-28 12:31:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,027 INFO L225 Difference]: With dead ends: 83 [2018-11-28 12:31:36,027 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 12:31:36,028 INFO L631 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-28 12:31:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 12:31:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-11-28 12:31:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 12:31:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-28 12:31:36,036 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-11-28 12:31:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,036 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-28 12:31:36,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:31:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-28 12:31:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:31:36,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,038 INFO L402 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-28 12:31:36,038 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-11-28 12:31:36,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,084 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-28 12:31:36,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:36,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:31:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:31:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:31:36,086 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-11-28 12:31:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,180 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-28 12:31:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:31:36,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 12:31:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,182 INFO L225 Difference]: With dead ends: 93 [2018-11-28 12:31:36,182 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:31:36,182 INFO L631 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-28 12:31:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:31:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-28 12:31:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 12:31:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-11-28 12:31:36,192 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-11-28 12:31:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,192 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-11-28 12:31:36,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:31:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-28 12:31:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:31:36,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,193 INFO L402 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-28 12:31:36,194 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1290914449, now seen corresponding path program 1 times [2018-11-28 12:31:36,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,224 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-28 12:31:36,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:36,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:31:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:31:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:31:36,225 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-11-28 12:31:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,266 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-11-28 12:31:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:31:36,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-28 12:31:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,267 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:31:36,268 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 12:31:36,268 INFO L631 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-28 12:31:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 12:31:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-28 12:31:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 12:31:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-28 12:31:36,276 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 39 [2018-11-28 12:31:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,277 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-28 12:31:36,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:31:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-28 12:31:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 12:31:36,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,278 INFO L402 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-28 12:31:36,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-11-28 12:31:36,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,316 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-28 12:31:36,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:31:36,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:31:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:31:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:31:36,317 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-28 12:31:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,348 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-11-28 12:31:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:31:36,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-28 12:31:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,351 INFO L225 Difference]: With dead ends: 98 [2018-11-28 12:31:36,351 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 12:31:36,352 INFO L631 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-28 12:31:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 12:31:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-28 12:31:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 12:31:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-11-28 12:31:36,359 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-11-28 12:31:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,360 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-11-28 12:31:36,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:31:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-28 12:31:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:31:36,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,361 INFO L402 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-28 12:31:36,361 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-11-28 12:31:36,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,408 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-28 12:31:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:31:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:31:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:31:36,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:31:36,409 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-11-28 12:31:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,417 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-28 12:31:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:31:36,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 12:31:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,419 INFO L225 Difference]: With dead ends: 94 [2018-11-28 12:31:36,419 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 12:31:36,419 INFO L631 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-28 12:31:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 12:31:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-28 12:31:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 12:31:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-11-28 12:31:36,425 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-11-28 12:31:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,425 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-28 12:31:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:31:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-11-28 12:31:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 12:31:36,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,427 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:31:36,427 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1523265789, now seen corresponding path program 1 times [2018-11-28 12:31:36,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 12:31:36,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:31:36,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:31:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:31:36,473 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-11-28 12:31:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,501 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-11-28 12:31:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:31:36,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 12:31:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,502 INFO L225 Difference]: With dead ends: 93 [2018-11-28 12:31:36,502 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 12:31:36,503 INFO L631 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-28 12:31:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 12:31:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-28 12:31:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 12:31:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-11-28 12:31:36,510 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 48 [2018-11-28 12:31:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,510 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-28 12:31:36,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:31:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-28 12:31:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:31:36,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,512 INFO L402 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-28 12:31:36,512 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1633453199, now seen corresponding path program 1 times [2018-11-28 12:31:36,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,552 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-28 12:31:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:36,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:31:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:31:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:31:36,554 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 5 states. [2018-11-28 12:31:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,601 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-28 12:31:36,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:31:36,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 12:31:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,602 INFO L225 Difference]: With dead ends: 89 [2018-11-28 12:31:36,602 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 12:31:36,603 INFO L631 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-28 12:31:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 12:31:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-11-28 12:31:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 12:31:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-28 12:31:36,611 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 58 [2018-11-28 12:31:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,611 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-28 12:31:36,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:31:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-11-28 12:31:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 12:31:36,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,612 INFO L402 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-28 12:31:36,613 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 375918826, now seen corresponding path program 1 times [2018-11-28 12:31:36,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,660 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-28 12:31:36,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:31:36,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/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-28 12:31:36,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:31:36,725 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-28 12:31:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:31:36,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-28 12:31:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:31:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:31:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:31:36,748 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 6 states. [2018-11-28 12:31:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:36,807 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2018-11-28 12:31:36,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:31:36,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-28 12:31:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:36,809 INFO L225 Difference]: With dead ends: 154 [2018-11-28 12:31:36,809 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 12:31:36,810 INFO L631 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-28 12:31:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 12:31:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-11-28 12:31:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 12:31:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-11-28 12:31:36,818 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 71 [2018-11-28 12:31:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:36,818 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-11-28 12:31:36,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:31:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-28 12:31:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 12:31:36,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:36,820 INFO L402 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-28 12:31:36,821 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 12:31:36,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -530823221, now seen corresponding path program 1 times [2018-11-28 12:31:36,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:36,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,890 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-28 12:31:36,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:31:36,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/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-28 12:31:36,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:36,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:31:37,004 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-28 12:31:37,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 12:31:37,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2018-11-28 12:31:37,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:31:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:31:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:31:37,023 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 11 states. [2018-11-28 12:31:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:37,138 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-28 12:31:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:31:37,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2018-11-28 12:31:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:31:37,139 INFO L225 Difference]: With dead ends: 97 [2018-11-28 12:31:37,139 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:31:37,140 INFO L631 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-28 12:31:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:31:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:31:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:31:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:31:37,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-11-28 12:31:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:31:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:31:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:31:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:31:37,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:31:37,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:31:37,269 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 12:31:37,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:31:37,269 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,269 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,269 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-28 12:31:37,270 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,270 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-28 12:31:37,270 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,270 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,270 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-28 12:31:37,270 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (< 0 |rec1_#in~i|) [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,271 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,272 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L444 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-28 12:31:37,273 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L444 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-28 12:31:37,273 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-28 12:31:37,273 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:31:37,273 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:31:37,273 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:31:37,274 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:31:37,274 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-28 12:31:37,274 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-28 12:31:37,274 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-28 12:31:37,274 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-28 12:31:37,276 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-28 12:31:37,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:31:37 BoogieIcfgContainer [2018-11-28 12:31:37,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:31:37,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:31:37,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:31:37,279 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:31:37,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:31:35" (3/4) ... [2018-11-28 12:31:37,285 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:31:37,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:31:37,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-28 12:31:37,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-28 12:31:37,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:31:37,296 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 12:31:37,296 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:31:37,296 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:31:37,342 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc2ce999-c306-44a4-9950-261a89ff01fb/bin-2019/uautomizer/witness.graphml [2018-11-28 12:31:37,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:31:37,343 INFO L168 Benchmark]: Toolchain (without parser) took 2518.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 957.1 MB in the beginning and 819.3 MB in the end (delta: 137.8 MB). Peak memory consumption was 284.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:31:37,344 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:31:37,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.87 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:31:37,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.71 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:31:37,345 INFO L168 Benchmark]: Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:31:37,345 INFO L168 Benchmark]: RCFGBuilder took 269.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:31:37,345 INFO L168 Benchmark]: TraceAbstraction took 2031.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 819.3 MB in the end (delta: 307.9 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:31:37,346 INFO L168 Benchmark]: Witness Printer took 63.60 ms. Allocated memory is still 1.2 GB. Free memory is still 819.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:31:37,347 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 124.87 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.71 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 269.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2031.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 819.3 MB in the end (delta: 307.9 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. * Witness Printer took 63.60 ms. Allocated memory is still 1.2 GB. Free memory is still 819.3 MB. There was no memory consumed. 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.9s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 663 SDtfs, 198 SDslu, 1356 SDs, 0 SdLazy, 362 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s 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, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 55391 SizeOfPredicates, 3 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 655/704 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...