./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/McCarthy91-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/McCarthy91-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edcc597a46f9ad79563531282ca675b8b1d7c4bf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:23:34,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:23:34,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:23:34,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:23:34,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:23:34,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:23:34,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:23:34,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:23:34,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:23:34,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:23:34,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:23:34,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:23:34,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:23:34,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:23:34,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:23:34,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:23:34,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:23:34,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:23:34,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:23:34,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:23:34,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:23:34,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:23:34,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:23:34,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:23:34,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:23:34,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:23:34,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:23:34,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:23:34,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:23:34,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:23:34,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:23:34,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:23:34,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:23:34,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:23:34,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:23:34,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:23:34,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:23:34,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:23:34,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:23:34,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:23:34,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:23:34,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-16 00:23:34,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:23:34,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:23:34,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:23:34,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:23:34,626 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:23:34,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:23:34,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:23:34,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:23:34,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:23:34,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:23:34,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:23:34,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:23:34,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:23:34,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:23:34,628 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-16 00:23:34,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:23:34,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:23:34,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:23:34,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:23:34,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:23:34,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:23:34,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:23:34,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:23:34,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:23:34,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:23:34,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:23:34,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:23:34,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:23:34,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:23:34,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:23:34,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edcc597a46f9ad79563531282ca675b8b1d7c4bf [2019-11-16 00:23:34,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:23:34,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:23:34,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:23:34,674 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:23:34,674 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:23:34,675 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/../../sv-benchmarks/c/recursive/McCarthy91-2.c [2019-11-16 00:23:34,743 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/data/7dddd6488/f29da69750bf4533aa25946440f68a4b/FLAGc24a32f5e [2019-11-16 00:23:35,065 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:23:35,066 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/sv-benchmarks/c/recursive/McCarthy91-2.c [2019-11-16 00:23:35,072 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/data/7dddd6488/f29da69750bf4533aa25946440f68a4b/FLAGc24a32f5e [2019-11-16 00:23:35,519 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/data/7dddd6488/f29da69750bf4533aa25946440f68a4b [2019-11-16 00:23:35,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:23:35,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:23:35,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:35,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:23:35,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:23:35,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af3be52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35, skipping insertion in model container [2019-11-16 00:23:35,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,542 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:23:35,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:23:35,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:35,864 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:23:35,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:35,895 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:23:35,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35 WrapperNode [2019-11-16 00:23:35,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:35,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:23:35,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:23:35,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:23:35,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:23:35,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:23:35,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:23:35,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:23:35,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... [2019-11-16 00:23:35,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:23:35,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:23:35,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:23:35,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:23:35,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/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 [2019-11-16 00:23:36,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:23:36,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:23:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2019-11-16 00:23:36,024 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2019-11-16 00:23:36,214 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:23:36,214 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:23:36,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:36 BoogieIcfgContainer [2019-11-16 00:23:36,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:23:36,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:23:36,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:23:36,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:23:36,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:23:35" (1/3) ... [2019-11-16 00:23:36,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bebb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:36, skipping insertion in model container [2019-11-16 00:23:36,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:35" (2/3) ... [2019-11-16 00:23:36,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bebb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:36, skipping insertion in model container [2019-11-16 00:23:36,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:36" (3/3) ... [2019-11-16 00:23:36,224 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2019-11-16 00:23:36,233 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:23:36,240 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-16 00:23:36,251 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-16 00:23:36,273 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:23:36,274 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:23:36,274 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:23:36,274 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:23:36,274 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:23:36,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:23:36,275 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:23:36,275 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:23:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-16 00:23:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-16 00:23:36,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:36,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:36,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 31043311, now seen corresponding path program 1 times [2019-11-16 00:23:36,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:36,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892955280] [2019-11-16 00:23:36,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:36,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892955280] [2019-11-16 00:23:36,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:36,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:36,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095314173] [2019-11-16 00:23:36,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:36,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:36,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:36,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:36,631 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-11-16 00:23:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:36,772 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-11-16 00:23:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:36,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-16 00:23:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:36,783 INFO L225 Difference]: With dead ends: 52 [2019-11-16 00:23:36,784 INFO L226 Difference]: Without dead ends: 41 [2019-11-16 00:23:36,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-16 00:23:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-11-16 00:23:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:23:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-11-16 00:23:36,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 5 [2019-11-16 00:23:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:36,832 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-16 00:23:36,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-11-16 00:23:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-16 00:23:36,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:36,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-16 00:23:36,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash 31043471, now seen corresponding path program 1 times [2019-11-16 00:23:36,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:36,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361811830] [2019-11-16 00:23:36,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:36,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361811830] [2019-11-16 00:23:36,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:36,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:23:36,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976111119] [2019-11-16 00:23:36,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:23:36,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:36,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:36,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:36,858 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 3 states. [2019-11-16 00:23:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:36,879 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-11-16 00:23:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:36,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-16 00:23:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:36,882 INFO L225 Difference]: With dead ends: 40 [2019-11-16 00:23:36,882 INFO L226 Difference]: Without dead ends: 39 [2019-11-16 00:23:36,883 INFO L600 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 [2019-11-16 00:23:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-16 00:23:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-11-16 00:23:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:23:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-11-16 00:23:36,893 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 5 [2019-11-16 00:23:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:36,893 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-11-16 00:23:36,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:23:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-11-16 00:23:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-16 00:23:36,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:36,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:23:36,895 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:36,895 INFO L82 PathProgramCache]: Analyzing trace with hash 962342709, now seen corresponding path program 1 times [2019-11-16 00:23:36,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:36,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106975537] [2019-11-16 00:23:36,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:36,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106975537] [2019-11-16 00:23:36,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:36,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:23:36,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299816205] [2019-11-16 00:23:36,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:23:36,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:36,918 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2019-11-16 00:23:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:36,941 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-11-16 00:23:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:36,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-16 00:23:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:36,944 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:23:36,944 INFO L226 Difference]: Without dead ends: 38 [2019-11-16 00:23:36,944 INFO L600 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 [2019-11-16 00:23:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-16 00:23:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-11-16 00:23:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:23:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-11-16 00:23:36,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 6 [2019-11-16 00:23:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:36,952 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-11-16 00:23:36,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:23:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-11-16 00:23:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-16 00:23:36,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:36,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:23:36,954 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash 962347674, now seen corresponding path program 1 times [2019-11-16 00:23:36,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:36,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216269441] [2019-11-16 00:23:36,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:37,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216269441] [2019-11-16 00:23:37,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:37,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:37,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303831256] [2019-11-16 00:23:37,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:37,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:37,009 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2019-11-16 00:23:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:37,096 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-11-16 00:23:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:37,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-16 00:23:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:37,098 INFO L225 Difference]: With dead ends: 50 [2019-11-16 00:23:37,098 INFO L226 Difference]: Without dead ends: 49 [2019-11-16 00:23:37,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-16 00:23:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-11-16 00:23:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:23:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-16 00:23:37,108 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 6 [2019-11-16 00:23:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:37,109 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-16 00:23:37,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-16 00:23:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:23:37,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:37,110 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:37,110 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash -703912792, now seen corresponding path program 1 times [2019-11-16 00:23:37,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:37,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074133518] [2019-11-16 00:23:37,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:37,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074133518] [2019-11-16 00:23:37,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:37,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:37,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157802214] [2019-11-16 00:23:37,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:37,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:37,145 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 5 states. [2019-11-16 00:23:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:37,225 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-11-16 00:23:37,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:37,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-16 00:23:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:37,227 INFO L225 Difference]: With dead ends: 68 [2019-11-16 00:23:37,227 INFO L226 Difference]: Without dead ends: 67 [2019-11-16 00:23:37,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-16 00:23:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2019-11-16 00:23:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-16 00:23:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-11-16 00:23:37,241 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 10 [2019-11-16 00:23:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:37,242 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-11-16 00:23:37,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-11-16 00:23:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:23:37,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:37,243 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:37,243 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1217128367, now seen corresponding path program 1 times [2019-11-16 00:23:37,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:37,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773524606] [2019-11-16 00:23:37,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:37,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773524606] [2019-11-16 00:23:37,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:37,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:37,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302290179] [2019-11-16 00:23:37,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:37,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:37,302 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 4 states. [2019-11-16 00:23:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:37,320 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-11-16 00:23:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:37,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:23:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:37,323 INFO L225 Difference]: With dead ends: 58 [2019-11-16 00:23:37,323 INFO L226 Difference]: Without dead ends: 47 [2019-11-16 00:23:37,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-16 00:23:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-16 00:23:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-16 00:23:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-11-16 00:23:37,334 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 13 [2019-11-16 00:23:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:37,335 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-11-16 00:23:37,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-11-16 00:23:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:23:37,336 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:37,336 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:37,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash -843390153, now seen corresponding path program 1 times [2019-11-16 00:23:37,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:37,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832744438] [2019-11-16 00:23:37,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:37,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832744438] [2019-11-16 00:23:37,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356815390] [2019-11-16 00:23:37,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:37,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:23:37,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:37,629 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:37,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-11-16 00:23:37,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164478076] [2019-11-16 00:23:37,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:23:37,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:23:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:23:37,631 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 15 states. [2019-11-16 00:23:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:38,014 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-11-16 00:23:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:23:38,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-16 00:23:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:38,017 INFO L225 Difference]: With dead ends: 70 [2019-11-16 00:23:38,017 INFO L226 Difference]: Without dead ends: 69 [2019-11-16 00:23:38,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:23:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-16 00:23:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2019-11-16 00:23:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:23:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-11-16 00:23:38,035 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2019-11-16 00:23:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:38,035 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-11-16 00:23:38,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:23:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-11-16 00:23:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:23:38,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:38,037 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:38,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:38,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:38,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash -375285934, now seen corresponding path program 1 times [2019-11-16 00:23:38,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:38,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406919231] [2019-11-16 00:23:38,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:38,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:38,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:23:38,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406919231] [2019-11-16 00:23:38,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:38,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:38,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255586676] [2019-11-16 00:23:38,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:38,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:38,346 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 7 states. [2019-11-16 00:23:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:38,515 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2019-11-16 00:23:38,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:23:38,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:23:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:38,517 INFO L225 Difference]: With dead ends: 98 [2019-11-16 00:23:38,517 INFO L226 Difference]: Without dead ends: 97 [2019-11-16 00:23:38,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:23:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-16 00:23:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2019-11-16 00:23:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-16 00:23:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-11-16 00:23:38,548 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 19 [2019-11-16 00:23:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:38,548 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-11-16 00:23:38,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-11-16 00:23:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:23:38,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:38,554 INFO L380 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-16 00:23:38,555 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-16 00:23:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash -50265865, now seen corresponding path program 1 times [2019-11-16 00:23:38,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:38,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187911700] [2019-11-16 00:23:38,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:38,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:38,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:23:38,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187911700] [2019-11-16 00:23:38,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:38,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:23:38,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133815017] [2019-11-16 00:23:38,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:23:38,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:23:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:38,685 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 8 states. [2019-11-16 00:23:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:38,867 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2019-11-16 00:23:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:23:38,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-16 00:23:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:38,869 INFO L225 Difference]: With dead ends: 92 [2019-11-16 00:23:38,869 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:23:38,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:23:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:23:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:23:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:23:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:23:38,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-16 00:23:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:38,873 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:23:38,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:23:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:23:38,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:23:38,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:23:39,188 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L27-2(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L27-3(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L27-4(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L27-6(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L27-7(lines 27 31) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,189 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-16 00:23:39,190 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:23:39,190 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:23:39,190 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648))) [2019-11-16 00:23:39,191 INFO L443 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-16 00:23:39,191 INFO L439 ceAbstractionStarter]: At program point L24(lines 24 32) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-16 00:23:39,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2019-11-16 00:23:39,191 INFO L443 ceAbstractionStarter]: For program point f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-11-16 00:23:39,191 INFO L443 ceAbstractionStarter]: For program point f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-11-16 00:23:39,191 INFO L443 ceAbstractionStarter]: For program point f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-16 00:23:39,192 INFO L443 ceAbstractionStarter]: For program point f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-16 00:23:39,192 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-16 00:23:39,192 INFO L443 ceAbstractionStarter]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. [2019-11-16 00:23:39,192 INFO L443 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-16 00:23:39,192 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-16 00:23:39,192 INFO L439 ceAbstractionStarter]: At program point L19-2(line 19) the Hoare annotation is: (let ((.cse0 (= f91_~x |f91_#in~x|))) (and (or (not (<= 0 (+ |f91_#in~x| 2147483648))) .cse0 (not (<= |f91_#in~x| 2147483647))) (or (not (<= 91 |f91_#in~x|)) (and .cse0 (<= f91_~x 100)) (not (<= |f91_#in~x| 2147483648))))) [2019-11-16 00:23:39,193 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-11-16 00:23:39,193 INFO L443 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-11-16 00:23:39,193 INFO L443 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. [2019-11-16 00:23:39,193 INFO L439 ceAbstractionStarter]: At program point L19-4(line 19) the Hoare annotation is: (let ((.cse0 (= f91_~x |f91_#in~x|))) (and (or (and .cse0 (<= f91_~x 100)) (not (<= 91 |f91_#in~x|)) (not (<= |f91_#in~x| 2147483648))) (or (not (<= 0 (+ |f91_#in~x| 2147483648))) (not (<= |f91_#in~x| 2147483647)) (and (<= 91 |f91_#t~ret0|) (and (<= |f91_#t~ret0| 2147483648) .cse0))))) [2019-11-16 00:23:39,193 INFO L443 ceAbstractionStarter]: For program point L19-5(line 19) no Hoare annotation was computed. [2019-11-16 00:23:39,193 INFO L446 ceAbstractionStarter]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2019-11-16 00:23:39,193 INFO L443 ceAbstractionStarter]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. [2019-11-16 00:23:39,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:23:39 BoogieIcfgContainer [2019-11-16 00:23:39,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:23:39,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:23:39,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:23:39,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:23:39,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:36" (3/4) ... [2019-11-16 00:23:39,213 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:23:39,220 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f91 [2019-11-16 00:23:39,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:23:39,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:23:39,274 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5e5523dd-f18e-4313-b616-62e0768e9404/bin/uautomizer/witness.graphml [2019-11-16 00:23:39,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:23:39,276 INFO L168 Benchmark]: Toolchain (without parser) took 3752.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.8 MB in the beginning and 836.9 MB in the end (delta: 107.9 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:39,277 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:39,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:39,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.41 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:39,279 INFO L168 Benchmark]: Boogie Preprocessor took 27.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:39,279 INFO L168 Benchmark]: RCFGBuilder took 257.14 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:39,280 INFO L168 Benchmark]: TraceAbstraction took 2990.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 843.9 MB in the end (delta: 267.1 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:39,280 INFO L168 Benchmark]: Witness Printer took 66.28 ms. Allocated memory is still 1.2 GB. Free memory was 843.9 MB in the beginning and 836.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:39,283 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.41 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 257.14 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: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2990.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 843.9 MB in the end (delta: 267.1 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.28 ms. Allocated memory is still 1.2 GB. Free memory was 843.9 MB in the beginning and 836.9 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 6 error locations. Result: SAFE, OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 7, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 177 SDtfs, 230 SDslu, 295 SDs, 0 SdLazy, 434 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 57 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 59 PreInvPairs, 60 NumberOfFragments, 83 HoareAnnotationTreeSize, 59 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 313 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 6147 SizeOfPredicates, 4 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 94/102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...