/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:56:53,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:56:53,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:56:53,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:56:53,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:56:53,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:56:53,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:56:53,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:56:53,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:56:53,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:56:53,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:56:53,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:56:53,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:56:53,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:56:53,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:56:53,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:56:53,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:56:53,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:56:53,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:56:53,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:56:53,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:56:53,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:56:53,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:56:53,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:56:53,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:56:53,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:56:53,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:56:53,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:56:53,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:56:53,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:56:53,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:56:53,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:56:53,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:56:53,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:56:53,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:56:53,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:56:53,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:56:53,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:56:53,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:56:53,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:56:53,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:56:53,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:56:53,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:56:53,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:56:53,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:56:53,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:56:53,983 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:56:53,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:56:53,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:56:53,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:56:53,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:56:53,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:56:53,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:56:53,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:56:53,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:56:53,985 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:56:53,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:56:53,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:56:53,986 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:56:53,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:56:53,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:56:53,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:56:53,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:56:53,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:56:53,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:56:53,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:56:53,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:56:53,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:56:53,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:56:53,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:56:53,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:56:53,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:56:54,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:56:54,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:56:54,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:56:54,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:56:54,299 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:56:54,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2019-11-23 21:56:54,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff4712ba/a587a7dd698d40e8a1a54b903423f95d/FLAG5659667b4 [2019-11-23 21:56:54,852 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:56:54,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2019-11-23 21:56:54,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff4712ba/a587a7dd698d40e8a1a54b903423f95d/FLAG5659667b4 [2019-11-23 21:56:55,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dff4712ba/a587a7dd698d40e8a1a54b903423f95d [2019-11-23 21:56:55,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:56:55,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:56:55,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:56:55,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:56:55,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:56:55,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc5d40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55, skipping insertion in model container [2019-11-23 21:56:55,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:56:55,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:56:55,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:56:55,530 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:56:55,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:56:55,658 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:56:55,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55 WrapperNode [2019-11-23 21:56:55,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:56:55,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:56:55,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:56:55,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:56:55,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:56:55,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:56:55,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:56:55,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:56:55,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... [2019-11-23 21:56:55,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:56:55,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:56:55,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:56:55,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:56:55,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:56:55,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:56:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:56:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:56:55,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:56:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:56:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:56:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 21:56:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:56:56,091 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:56:56,091 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-23 21:56:56,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:56 BoogieIcfgContainer [2019-11-23 21:56:56,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:56:56,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:56:56,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:56:56,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:56:56,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:56:55" (1/3) ... [2019-11-23 21:56:56,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588f00d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:56, skipping insertion in model container [2019-11-23 21:56:56,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:55" (2/3) ... [2019-11-23 21:56:56,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588f00d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:56, skipping insertion in model container [2019-11-23 21:56:56,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:56" (3/3) ... [2019-11-23 21:56:56,100 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2019-11-23 21:56:56,110 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:56:56,120 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:56:56,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:56:56,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:56:56,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:56:56,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:56:56,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:56:56,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:56:56,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:56:56,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:56:56,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:56:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-23 21:56:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 21:56:56,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:56,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:56,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-11-23 21:56:56,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:56,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672192708] [2019-11-23 21:56:56,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:56,337 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-23 21:56:56,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672192708] [2019-11-23 21:56:56,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:56,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:56:56,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351766711] [2019-11-23 21:56:56,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:56:56,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:56:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:56:56,366 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-23 21:56:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:56,392 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-23 21:56:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:56:56,394 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-23 21:56:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:56,407 INFO L225 Difference]: With dead ends: 30 [2019-11-23 21:56:56,407 INFO L226 Difference]: Without dead ends: 13 [2019-11-23 21:56:56,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:56:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-23 21:56:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-23 21:56:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-23 21:56:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-23 21:56:56,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-11-23 21:56:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:56,469 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-23 21:56:56,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:56:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-11-23 21:56:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:56:56,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:56,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:56,472 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-11-23 21:56:56,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:56,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261903850] [2019-11-23 21:56:56,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:56,584 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-23 21:56:56,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261903850] [2019-11-23 21:56:56,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:56,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:56:56,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209355931] [2019-11-23 21:56:56,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:56:56,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:56:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:56:56,591 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-11-23 21:56:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:56,631 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-23 21:56:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:56:56,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 21:56:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:56,634 INFO L225 Difference]: With dead ends: 24 [2019-11-23 21:56:56,634 INFO L226 Difference]: Without dead ends: 15 [2019-11-23 21:56:56,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 21:56:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-23 21:56:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-23 21:56:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-23 21:56:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-23 21:56:56,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-11-23 21:56:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:56,641 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-23 21:56:56,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:56:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-23 21:56:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 21:56:56,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:56,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:56,643 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2019-11-23 21:56:56,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:56,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817760053] [2019-11-23 21:56:56,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:56,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817760053] [2019-11-23 21:56:56,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691593332] [2019-11-23 21:56:56,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:56:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:56,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:56:56,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:56:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:56,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:56:56,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 21:56:56,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289773794] [2019-11-23 21:56:56,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:56:56,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:56:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:56:56,904 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-11-23 21:56:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:56,948 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-23 21:56:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:56:56,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-23 21:56:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:56,951 INFO L225 Difference]: With dead ends: 26 [2019-11-23 21:56:56,951 INFO L226 Difference]: Without dead ends: 17 [2019-11-23 21:56:56,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:56:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-23 21:56:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-23 21:56:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-23 21:56:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-11-23 21:56:56,959 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-11-23 21:56:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:56,960 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-23 21:56:56,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:56:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-11-23 21:56:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:56:56,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:56,962 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:57,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:57,163 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2019-11-23 21:56:57,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:57,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400384373] [2019-11-23 21:56:57,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:57,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400384373] [2019-11-23 21:56:57,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535674930] [2019-11-23 21:56:57,300 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:57,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-23 21:56:57,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:56:57,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 21:56:57,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:56:57,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:56:57,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:56:57,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-23 21:56:57,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:56:57,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:56:57,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:56:57,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-23 21:56:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 21:56:57,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:56:57,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-23 21:56:57,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133921809] [2019-11-23 21:56:57,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:56:57,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:57,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:56:57,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:56:57,547 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2019-11-23 21:56:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:57,634 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-23 21:56:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:56:57,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-23 21:56:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:57,635 INFO L225 Difference]: With dead ends: 23 [2019-11-23 21:56:57,635 INFO L226 Difference]: Without dead ends: 18 [2019-11-23 21:56:57,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:56:57,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-23 21:56:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-23 21:56:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-23 21:56:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-23 21:56:57,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-11-23 21:56:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:57,641 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-23 21:56:57,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:56:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-23 21:56:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:56:57,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:57,642 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:57,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:57,848 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1859304665, now seen corresponding path program 1 times [2019-11-23 21:56:57,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:57,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917597498] [2019-11-23 21:56:57,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:56:57,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917597498] [2019-11-23 21:56:57,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795096751] [2019-11-23 21:56:57,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:57,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:56:57,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:56:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:56:57,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:56:57,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 21:56:57,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424239057] [2019-11-23 21:56:57,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:56:57,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:56:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:56:57,991 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-11-23 21:56:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:58,025 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-23 21:56:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:56:58,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-23 21:56:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:58,029 INFO L225 Difference]: With dead ends: 32 [2019-11-23 21:56:58,029 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 21:56:58,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:56:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 21:56:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-23 21:56:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-23 21:56:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-23 21:56:58,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-11-23 21:56:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:58,034 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-23 21:56:58,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:56:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-23 21:56:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:56:58,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:58,035 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:58,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:58,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash 291228695, now seen corresponding path program 2 times [2019-11-23 21:56:58,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:58,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584396324] [2019-11-23 21:56:58,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:56:58,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584396324] [2019-11-23 21:56:58,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050794534] [2019-11-23 21:56:58,362 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:58,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:56:58,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:56:58,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:56:58,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:56:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:56:58,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:56:58,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 21:56:58,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539774231] [2019-11-23 21:56:58,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:56:58,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:56:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:56:58,431 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-11-23 21:56:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:58,468 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-23 21:56:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:56:58,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-23 21:56:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:58,473 INFO L225 Difference]: With dead ends: 34 [2019-11-23 21:56:58,473 INFO L226 Difference]: Without dead ends: 23 [2019-11-23 21:56:58,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:56:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-23 21:56:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-23 21:56:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 21:56:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-23 21:56:58,478 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-11-23 21:56:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:58,478 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-23 21:56:58,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:56:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-23 21:56:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:56:58,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:58,479 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:58,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:58,683 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 903742421, now seen corresponding path program 3 times [2019-11-23 21:56:58,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:58,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096243950] [2019-11-23 21:56:58,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:56:58,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096243950] [2019-11-23 21:56:58,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686366576] [2019-11-23 21:56:58,752 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:56:58,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-23 21:56:58,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:56:58,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 21:56:58,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:56:58,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:56:58,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:56:58,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-23 21:56:58,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:56:58,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:56:58,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:56:58,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-23 21:56:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 21:56:58,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:56:58,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-23 21:56:58,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746916183] [2019-11-23 21:56:58,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:56:58,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:58,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:56:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:56:58,917 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2019-11-23 21:57:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:01,270 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-23 21:57:01,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:57:01,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-23 21:57:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:01,276 INFO L225 Difference]: With dead ends: 38 [2019-11-23 21:57:01,276 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 21:57:01,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:57:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 21:57:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-23 21:57:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 21:57:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-23 21:57:01,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-11-23 21:57:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:01,282 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-23 21:57:01,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:57:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-23 21:57:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:57:01,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:01,284 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:01,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:01,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1251069224, now seen corresponding path program 4 times [2019-11-23 21:57:01,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:01,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682287813] [2019-11-23 21:57:01,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 21:57:01,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682287813] [2019-11-23 21:57:01,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141975404] [2019-11-23 21:57:01,626 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:01,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:57:01,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:01,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 21:57:01,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:05,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:57:05,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:05,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-23 21:57:05,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:05,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:05,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:05,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-23 21:57:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 21:57:05,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:05,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-23 21:57:05,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170724512] [2019-11-23 21:57:05,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:57:05,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:05,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:57:05,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=2, NotChecked=0, Total=156 [2019-11-23 21:57:05,935 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-23 21:57:10,071 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-23 21:57:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:10,187 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-23 21:57:10,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:57:10,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-23 21:57:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:10,188 INFO L225 Difference]: With dead ends: 44 [2019-11-23 21:57:10,188 INFO L226 Difference]: Without dead ends: 31 [2019-11-23 21:57:10,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=57, Invalid=181, Unknown=2, NotChecked=0, Total=240 [2019-11-23 21:57:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-23 21:57:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-23 21:57:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:57:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-23 21:57:10,193 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-11-23 21:57:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:10,194 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-23 21:57:10,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:57:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-23 21:57:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:57:10,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:10,195 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:10,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:10,399 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1378869733, now seen corresponding path program 5 times [2019-11-23 21:57:10,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:10,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054131765] [2019-11-23 21:57:10,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 21:57:10,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054131765] [2019-11-23 21:57:10,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208896970] [2019-11-23 21:57:10,495 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:11,622 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-23 21:57:11,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:11,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:57:11,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 21:57:11,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:11,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-23 21:57:11,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973580258] [2019-11-23 21:57:11,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:57:11,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:57:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:11,639 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-11-23 21:57:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:11,693 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-11-23 21:57:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:57:11,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-23 21:57:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:11,696 INFO L225 Difference]: With dead ends: 48 [2019-11-23 21:57:11,696 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 21:57:11,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 21:57:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-23 21:57:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 21:57:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-23 21:57:11,702 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-11-23 21:57:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:11,702 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-23 21:57:11,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:57:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-23 21:57:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:57:11,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:11,703 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:11,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:11,904 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1005994073, now seen corresponding path program 6 times [2019-11-23 21:57:11,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:11,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368379029] [2019-11-23 21:57:11,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 21:57:12,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368379029] [2019-11-23 21:57:12,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600513177] [2019-11-23 21:57:12,023 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:12,131 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-23 21:57:12,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:12,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 21:57:12,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:12,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-23 21:57:12,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:12,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:12,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:57:12,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:12,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:12,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:12,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:20 [2019-11-23 21:57:12,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-23 21:57:12,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:12,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-23 21:57:12,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031830346] [2019-11-23 21:57:12,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:57:12,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:57:12,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:12,359 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 18 states. [2019-11-23 21:57:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:12,866 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-23 21:57:12,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:57:12,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-11-23 21:57:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:12,867 INFO L225 Difference]: With dead ends: 48 [2019-11-23 21:57:12,868 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:57:12,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:57:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:57:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:57:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:57:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:57:12,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-23 21:57:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:12,870 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:57:12,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:57:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:57:12,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:57:13,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:13,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:57:13,143 INFO L444 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L440 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (= 0 |ULTIMATE.start_main_~#cont~0.offset|) [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-23 21:57:13,144 INFO L447 ceAbstractionStarter]: At program point L49(lines 20 50) the Hoare annotation is: true [2019-11-23 21:57:13,144 INFO L440 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2019-11-23 21:57:13,145 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2019-11-23 21:57:13,145 INFO L440 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (and (= ULTIMATE.start_main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= 0 |ULTIMATE.start_main_~#cont~0.offset|)) [2019-11-23 21:57:13,145 INFO L444 ceAbstractionStarter]: For program point L37-4(lines 37 39) no Hoare annotation was computed. [2019-11-23 21:57:13,145 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:57:13,145 INFO L440 ceAbstractionStarter]: At program point L17(lines 15 18) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (let ((.cse0 (select (select |#memory_int| .cse2) .cse1))) (and (<= .cse0 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~pa~0.offset .cse1) (= .cse2 ULTIMATE.start_main_~pa~0.base) (= 1 |ULTIMATE.start_check_#res|) (<= ULTIMATE.start_main_~i~0 .cse0) (= 0 |ULTIMATE.start_main_~#cont~0.offset|)))) [2019-11-23 21:57:13,145 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2019-11-23 21:57:13,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,167 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,167 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:57:13 BoogieIcfgContainer [2019-11-23 21:57:13,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:57:13,172 INFO L168 Benchmark]: Toolchain (without parser) took 17914.58 ms. Allocated memory was 144.7 MB in the beginning and 249.0 MB in the end (delta: 104.3 MB). Free memory was 102.2 MB in the beginning and 147.8 MB in the end (delta: -45.6 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,173 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.04 ms. Allocated memory was 144.7 MB in the beginning and 200.8 MB in the end (delta: 56.1 MB). Free memory was 102.0 MB in the beginning and 178.5 MB in the end (delta: -76.5 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 200.8 MB. Free memory was 178.5 MB in the beginning and 176.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,175 INFO L168 Benchmark]: Boogie Preprocessor took 36.47 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 175.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,176 INFO L168 Benchmark]: RCFGBuilder took 358.30 ms. Allocated memory is still 200.8 MB. Free memory was 175.2 MB in the beginning and 159.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,177 INFO L168 Benchmark]: TraceAbstraction took 17077.02 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 158.6 MB in the beginning and 147.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:57:13,180 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.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 400.04 ms. Allocated memory was 144.7 MB in the beginning and 200.8 MB in the end (delta: 56.1 MB). Free memory was 102.0 MB in the beginning and 178.5 MB in the end (delta: -76.5 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 200.8 MB. Free memory was 178.5 MB in the beginning and 176.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.47 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 175.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 358.30 ms. Allocated memory is still 200.8 MB. Free memory was 175.2 MB in the beginning and 159.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17077.02 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 158.6 MB in the beginning and 147.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 59.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant [2019-11-23 21:57:13,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] <= i && pa == #memory_$Pointer$[cont][cont] + 4) && #memory_$Pointer$[cont][cont] == pa) && 1 == \result) && i <= unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && 0 == cont - InvariantResult [Line: 37]: Loop Invariant [2019-11-23 21:57:13,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-23 21:57:13,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-23 21:57:13,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-23 21:57:13,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-23 21:57:13,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((pa == #memory_$Pointer$[cont][cont] + 4 && #memory_$Pointer$[cont][cont] == pa) && i <= unknown-#memory_int-unknown[pa][pa]) && 0 == cont - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == cont - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 16.9s, OverallIterations: 10, TraceHistogramMax: 7, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 52 SDslu, 316 SDs, 0 SdLazy, 384 SolverSat, 14 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 19 NumberOfFragments, 89 HoareAnnotationTreeSize, 5 FomulaSimplifications, 205 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 87 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 361 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 343 ConstructedInterpolants, 9 QuantifiedInterpolants, 26877 SizeOfPredicates, 57 NumberOfNonLiveVariables, 808 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 155/360 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...