./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/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 cb528549fa76ae8087cf7043645dfa20323a0116 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:18:42,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:18:42,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:18:42,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:18:42,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:18:42,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:18:42,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:18:42,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:18:42,485 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:18:42,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:18:42,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:18:42,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:18:42,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:18:42,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:18:42,488 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:18:42,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:18:42,489 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:18:42,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:18:42,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:18:42,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:18:42,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:18:42,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:18:42,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:18:42,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:18:42,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:18:42,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:18:42,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:18:42,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:18:42,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:18:42,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:18:42,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:18:42,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:18:42,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:18:42,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:18:42,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:18:42,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:18:42,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 13:18:42,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:18:42,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:18:42,509 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:18:42,509 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:18:42,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:18:42,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:18:42,510 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:18:42,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:18:42,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:18:42,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:18:42,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:18:42,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:18:42,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:18:42,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:18:42,511 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 13:18:42,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:18:42,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:18:42,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:18:42,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:18:42,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:18:42,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:18:42,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:18:42,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:18:42,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:18:42,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:18:42,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:18:42,513 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:18:42,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:18:42,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:18:42,513 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_43d4df73-38f5-4dd1-9346-e6638348ab97/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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-11-23 13:18:42,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:18:42,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:18:42,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:18:42,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:18:42,549 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:18:42,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 13:18:42,586 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/data/3d539fbbc/a4b063449fbf4e988af25b83d2ee6ed1/FLAG9dffe3b43 [2018-11-23 13:18:42,881 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:18:42,881 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 13:18:42,885 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/data/3d539fbbc/a4b063449fbf4e988af25b83d2ee6ed1/FLAG9dffe3b43 [2018-11-23 13:18:42,895 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/data/3d539fbbc/a4b063449fbf4e988af25b83d2ee6ed1 [2018-11-23 13:18:42,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:18:42,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:18:42,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:18:42,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:18:42,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:18:42,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:18:42" (1/1) ... [2018-11-23 13:18:42,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12858536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:42, skipping insertion in model container [2018-11-23 13:18:42,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:18:42" (1/1) ... [2018-11-23 13:18:42,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:18:42,921 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:18:43,022 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:18:43,024 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:18:43,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:18:43,044 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:18:43,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43 WrapperNode [2018-11-23 13:18:43,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:18:43,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:18:43,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:18:43,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:18:43,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:18:43,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:18:43,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:18:43,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:18:43,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... [2018-11-23 13:18:43,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:18:43,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:18:43,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:18:43,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:18:43,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/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-23 13:18:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:18:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:18:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-23 13:18:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-23 13:18:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-23 13:18:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-23 13:18:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:18:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:18:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:18:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:18:43,301 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:18:43,301 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:18:43,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:18:43 BoogieIcfgContainer [2018-11-23 13:18:43,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:18:43,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:18:43,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:18:43,305 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:18:43,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:18:42" (1/3) ... [2018-11-23 13:18:43,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c019981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:18:43, skipping insertion in model container [2018-11-23 13:18:43,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:18:43" (2/3) ... [2018-11-23 13:18:43,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c019981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:18:43, skipping insertion in model container [2018-11-23 13:18:43,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:18:43" (3/3) ... [2018-11-23 13:18:43,308 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 13:18:43,318 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:18:43,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-23 13:18:43,338 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-23 13:18:43,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:18:43,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:18:43,365 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:18:43,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:18:43,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:18:43,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:18:43,366 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:18:43,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:18:43,366 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:18:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 13:18:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:18:43,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:43,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:43,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:43,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:43,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-23 13:18:43,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:43,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:43,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:43,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:43,538 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-23 13:18:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:18:43,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:18:43,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:18:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:18:43,551 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-23 13:18:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:43,627 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 13:18:43,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:18:43,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-23 13:18:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:43,637 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:18:43,637 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:18:43,639 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-23 13:18:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:18:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-23 13:18:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:18:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 13:18:43,667 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-23 13:18:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:43,667 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 13:18:43,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:18:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 13:18:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:18:43,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:43,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:43,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:43,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-23 13:18:43,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:43,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:43,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:43,690 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-23 13:18:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:43,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:18:43,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:18:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:18:43,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:18:43,693 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-23 13:18:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:43,721 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 13:18:43,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:18:43,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:18:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:43,722 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:18:43,723 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:18:43,723 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-23 13:18:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:18:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 13:18:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:18:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 13:18:43,729 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-11-23 13:18:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:43,730 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 13:18:43,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:18:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 13:18:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:18:43,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:43,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:43,731 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:43,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-11-23 13:18:43,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:43,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:43,768 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-23 13:18:43,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:43,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:18:43,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:18:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:18:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:18:43,769 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-11-23 13:18:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:43,846 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-23 13:18:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:18:43,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:18:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:43,848 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:18:43,848 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:18:43,848 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-23 13:18:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:18:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-23 13:18:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:18:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-23 13:18:43,860 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-11-23 13:18:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:43,860 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-23 13:18:43,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:18:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 13:18:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:18:43,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:43,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:43,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:43,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:43,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-11-23 13:18:43,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:43,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:43,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:43,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:43,890 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-23 13:18:43,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:43,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:18:43,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:18:43,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:18:43,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:18:43,891 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-11-23 13:18:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:43,901 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-11-23 13:18:43,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:18:43,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:18:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:43,902 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:18:43,902 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 13:18:43,903 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-23 13:18:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 13:18:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-23 13:18:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:18:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-23 13:18:43,911 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-11-23 13:18:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:43,912 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-23 13:18:43,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:18:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-23 13:18:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:18:43,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:43,912 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:43,913 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:43,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-11-23 13:18:43,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:43,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:43,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:43,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:43,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:18:43,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:18:43,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:18:43,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:18:43,940 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-11-23 13:18:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:43,988 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-23 13:18:43,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:18:43,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:18:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:43,989 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:18:43,989 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:18:43,990 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-23 13:18:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:18:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 13:18:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:18:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-23 13:18:43,997 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-11-23 13:18:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:43,997 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-23 13:18:43,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:18:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 13:18:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:18:43,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:43,998 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] [2018-11-23 13:18:43,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:43,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-11-23 13:18:43,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:43,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:43,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,030 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-23 13:18:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:18:44,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:18:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:18:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:18:44,031 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-11-23 13:18:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,045 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 13:18:44,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:18:44,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 13:18:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,046 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:18:44,046 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:18:44,046 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-23 13:18:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:18:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 13:18:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:18:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-23 13:18:44,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-11-23 13:18:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,051 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-23 13:18:44,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:18:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 13:18:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:18:44,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,052 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-23 13:18:44,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-11-23 13:18:44,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,067 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-23 13:18:44,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:18:44,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:18:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:18:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:18:44,068 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-11-23 13:18:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,080 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 13:18:44,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:18:44,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 13:18:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,082 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:18:44,082 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:18:44,082 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-23 13:18:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:18:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 13:18:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:18:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-23 13:18:44,089 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-11-23 13:18:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,089 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-23 13:18:44,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:18:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-23 13:18:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:18:44,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,090 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-23 13:18:44,091 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-11-23 13:18:44,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,122 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-23 13:18:44,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:18:44,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:18:44,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:18:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:18:44,123 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-11-23 13:18:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,134 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-23 13:18:44,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:18:44,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 13:18:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,135 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:18:44,135 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:18:44,136 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-23 13:18:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:18:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-23 13:18:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:18:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-11-23 13:18:44,143 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-11-23 13:18:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,143 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-23 13:18:44,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:18:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-11-23 13:18:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:18:44,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,144 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, 1] [2018-11-23 13:18:44,145 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-11-23 13:18:44,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,167 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-23 13:18:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:18:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:18:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:18:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:18:44,168 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-11-23 13:18:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,183 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-23 13:18:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:18:44,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 13:18:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,184 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:18:44,184 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:18:44,185 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-23 13:18:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:18:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 13:18:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:18:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-23 13:18:44,190 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-11-23 13:18:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,190 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-23 13:18:44,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:18:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-23 13:18:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:18:44,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,191 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:44,191 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-11-23 13:18:44,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:18:44,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:18:44,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:18:44,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:18:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:18:44,215 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-11-23 13:18:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,278 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-23 13:18:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:18:44,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 13:18:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,280 INFO L225 Difference]: With dead ends: 105 [2018-11-23 13:18:44,280 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 13:18:44,281 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-23 13:18:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 13:18:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-23 13:18:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 13:18:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-23 13:18:44,292 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-11-23 13:18:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,292 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-23 13:18:44,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:18:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-23 13:18:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:18:44,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,295 INFO L402 BasicCegarLoop]: trace histogram [5, 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] [2018-11-23 13:18:44,296 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 505515198, now seen corresponding path program 1 times [2018-11-23 13:18:44,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 13:18:44,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:18:44,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:18:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:18:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:18:44,340 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-11-23 13:18:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,397 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-23 13:18:44,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:18:44,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-23 13:18:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,398 INFO L225 Difference]: With dead ends: 104 [2018-11-23 13:18:44,398 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 13:18:44,399 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-23 13:18:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 13:18:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-23 13:18:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 13:18:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-11-23 13:18:44,407 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 38 [2018-11-23 13:18:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,408 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-11-23 13:18:44,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:18:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-11-23 13:18:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:18:44,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,411 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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-23 13:18:44,411 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,412 INFO L82 PathProgramCache]: Analyzing trace with hash -30814145, now seen corresponding path program 1 times [2018-11-23 13:18:44,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 13:18:44,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:18:44,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:18:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:18:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:18:44,452 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-11-23 13:18:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,467 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 13:18:44,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:18:44,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 13:18:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,469 INFO L225 Difference]: With dead ends: 110 [2018-11-23 13:18:44,469 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 13:18:44,470 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-23 13:18:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 13:18:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-23 13:18:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 13:18:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-11-23 13:18:44,477 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 36 [2018-11-23 13:18:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,477 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-11-23 13:18:44,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:18:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-11-23 13:18:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:18:44,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,478 INFO L402 BasicCegarLoop]: trace histogram [5, 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] [2018-11-23 13:18:44,479 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash -464316786, now seen corresponding path program 1 times [2018-11-23 13:18:44,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 13:18:44,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:18:44,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:18:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:18:44,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:18:44,505 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-11-23 13:18:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,518 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-23 13:18:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:18:44,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-23 13:18:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,519 INFO L225 Difference]: With dead ends: 106 [2018-11-23 13:18:44,519 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 13:18:44,519 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-23 13:18:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 13:18:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 13:18:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 13:18:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-11-23 13:18:44,526 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 42 [2018-11-23 13:18:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,527 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-11-23 13:18:44,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:18:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-11-23 13:18:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:18:44,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,528 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:44,529 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-11-23 13:18:44,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:18:44,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:44,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/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-23 13:18:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:18:44,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:44,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:18:44,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:18:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:18:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:18:44,643 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 6 states. [2018-11-23 13:18:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,701 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-11-23 13:18:44,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:18:44,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-23 13:18:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,703 INFO L225 Difference]: With dead ends: 121 [2018-11-23 13:18:44,703 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 13:18:44,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:18:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 13:18:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-11-23 13:18:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 13:18:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2018-11-23 13:18:44,712 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 40 [2018-11-23 13:18:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,713 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2018-11-23 13:18:44,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:18:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2018-11-23 13:18:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:18:44,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,714 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 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, 1, 1, 1] [2018-11-23 13:18:44,714 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1469659330, now seen corresponding path program 1 times [2018-11-23 13:18:44,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 13:18:44,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:18:44,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:18:44,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:18:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:18:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:18:44,760 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand 5 states. [2018-11-23 13:18:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,805 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2018-11-23 13:18:44,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:18:44,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-23 13:18:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,807 INFO L225 Difference]: With dead ends: 109 [2018-11-23 13:18:44,807 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 13:18:44,807 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-23 13:18:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 13:18:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-11-23 13:18:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 13:18:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-11-23 13:18:44,815 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 47 [2018-11-23 13:18:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:44,816 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-11-23 13:18:44,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:18:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-11-23 13:18:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:18:44,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:44,819 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 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] [2018-11-23 13:18:44,820 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:44,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1920964512, now seen corresponding path program 1 times [2018-11-23 13:18:44,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 19 proven. 32 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-23 13:18:44,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:44,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/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-23 13:18:44,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:44,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-23 13:18:44,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:18:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-23 13:18:44,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:18:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:18:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:18:44,945 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 6 states. [2018-11-23 13:18:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:44,989 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-11-23 13:18:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:18:44,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-11-23 13:18:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:44,991 INFO L225 Difference]: With dead ends: 185 [2018-11-23 13:18:44,991 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 13:18:44,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 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-23 13:18:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 13:18:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-23 13:18:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 13:18:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-11-23 13:18:45,000 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 86 [2018-11-23 13:18:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:45,000 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-23 13:18:45,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:18:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2018-11-23 13:18:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 13:18:45,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:45,002 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:45,003 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:45,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash 814042608, now seen corresponding path program 1 times [2018-11-23 13:18:45,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:45,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 58 proven. 13 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-23 13:18:45,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:45,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:45,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:45,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-23 13:18:45,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:45,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2018-11-23 13:18:45,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:18:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:18:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:18:45,209 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 13 states. [2018-11-23 13:18:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:45,477 INFO L93 Difference]: Finished difference Result 249 states and 323 transitions. [2018-11-23 13:18:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:18:45,478 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-11-23 13:18:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:45,479 INFO L225 Difference]: With dead ends: 249 [2018-11-23 13:18:45,479 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 13:18:45,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:18:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 13:18:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2018-11-23 13:18:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 13:18:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2018-11-23 13:18:45,492 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 95 [2018-11-23 13:18:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:45,493 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2018-11-23 13:18:45,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:18:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2018-11-23 13:18:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:18:45,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:45,495 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:45,495 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:45,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 2 times [2018-11-23 13:18:45,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:45,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 13:18:45,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:45,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:45,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:18:45,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:18:45,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:45,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 13:18:45,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:45,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 13:18:45,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:18:45,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:18:45,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:18:45,592 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 6 states. [2018-11-23 13:18:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:45,611 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-11-23 13:18:45,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:18:45,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-23 13:18:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:45,612 INFO L225 Difference]: With dead ends: 145 [2018-11-23 13:18:45,612 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 13:18:45,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:18:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 13:18:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-23 13:18:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 13:18:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-11-23 13:18:45,619 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 64 [2018-11-23 13:18:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:45,619 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2018-11-23 13:18:45,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:18:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2018-11-23 13:18:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 13:18:45,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:45,620 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:45,621 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:45,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:45,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1752120243, now seen corresponding path program 1 times [2018-11-23 13:18:45,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:45,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 13:18:45,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:45,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:45,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:45,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-23 13:18:45,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:45,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:18:45,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:18:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:18:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:18:45,733 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 6 states. [2018-11-23 13:18:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:45,808 INFO L93 Difference]: Finished difference Result 294 states and 375 transitions. [2018-11-23 13:18:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:18:45,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-11-23 13:18:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:45,810 INFO L225 Difference]: With dead ends: 294 [2018-11-23 13:18:45,810 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 13:18:45,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:18:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 13:18:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2018-11-23 13:18:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 13:18:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2018-11-23 13:18:45,818 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 84 [2018-11-23 13:18:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:45,818 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2018-11-23 13:18:45,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:18:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2018-11-23 13:18:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 13:18:45,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:45,819 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:45,820 INFO L423 AbstractCegarLoop]: === Iteration 20 === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:18:45,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1524494125, now seen corresponding path program 2 times [2018-11-23 13:18:45,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:45,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:45,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:18:45,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 49 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-23 13:18:45,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:45,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:18:45,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:18:45,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:45,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 214 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 13:18:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:45,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 13:18:45,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:18:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:18:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:18:45,940 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand 8 states. [2018-11-23 13:18:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:46,041 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2018-11-23 13:18:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:18:46,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-11-23 13:18:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:46,043 INFO L225 Difference]: With dead ends: 199 [2018-11-23 13:18:46,043 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:18:46,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:18:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:18:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:18:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:18:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:18:46,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2018-11-23 13:18:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:46,045 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:18:46,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:18:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:18:46,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:46,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:18:46,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:18:46,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:18:46,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:18:46,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:18:46,362 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-23 13:18:46,362 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (<= rec1_~i |rec1_#in~i|) (< 2147483646 |rec1_#in~i|)) (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i 2147483647) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret1| 0) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))) [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,363 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j |rec2_#in~j|) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,364 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,365 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j |rec2_#in~j|) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (or (<= |rec2_#t~ret3| 0) (< 1 |rec2_#in~j|))) [2018-11-23 13:18:46,365 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,365 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,365 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-23 13:18:46,365 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-23 13:18:46,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:18:46,365 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:18:46,365 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:18:46,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:18:46,365 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-23 13:18:46,369 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-23 13:18:46,370 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-23 13:18:46,370 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-23 13:18:46,370 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-23 13:18:46,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:18:46 BoogieIcfgContainer [2018-11-23 13:18:46,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:18:46,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:18:46,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:18:46,373 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:18:46,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:18:43" (3/4) ... [2018-11-23 13:18:46,378 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:18:46,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:18:46,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-23 13:18:46,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-23 13:18:46,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:18:46,389 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:18:46,390 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:18:46,390 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:18:46,429 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_43d4df73-38f5-4dd1-9346-e6638348ab97/bin-2019/uautomizer/witness.graphml [2018-11-23 13:18:46,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:18:46,430 INFO L168 Benchmark]: Toolchain (without parser) took 3531.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:18:46,431 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:18:46,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.89 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:18:46,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.59 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:18:46,432 INFO L168 Benchmark]: Boogie Preprocessor took 11.94 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:18:46,432 INFO L168 Benchmark]: RCFGBuilder took 232.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:18:46,432 INFO L168 Benchmark]: TraceAbstraction took 3070.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:18:46,432 INFO L168 Benchmark]: Witness Printer took 56.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:18:46,434 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.89 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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.59 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.94 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 232.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3070.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * Witness Printer took 56.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 3.0s OverallTime, 20 OverallIterations, 13 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 822 SDtfs, 325 SDslu, 1932 SDs, 0 SdLazy, 784 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=19, 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, 20 MinimizatonAttempts, 102 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 299 PreInvPairs, 337 NumberOfFragments, 109 HoareAnnotationTreeSize, 299 FomulaSimplifications, 1341 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 459 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 125972 SizeOfPredicates, 9 NumberOfNonLiveVariables, 987 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 1904/2144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...