./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:32:43,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:32:43,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:32:43,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:32:43,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:32:43,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:32:43,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:32:43,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:32:43,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:32:44,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:32:44,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:32:44,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:32:44,005 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:32:44,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:32:44,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:32:44,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:32:44,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:32:44,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:32:44,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:32:44,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:32:44,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:32:44,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:32:44,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:32:44,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:32:44,020 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:32:44,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:32:44,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:32:44,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:32:44,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:32:44,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:32:44,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:32:44,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:32:44,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:32:44,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:32:44,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:32:44,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:32:44,035 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:32:44,059 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:32:44,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:32:44,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:32:44,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:32:44,063 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:32:44,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:32:44,063 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:32:44,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:32:44,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:32:44,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:32:44,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:32:44,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:32:44,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:32:44,065 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:32:44,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:32:44,066 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:32:44,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:32:44,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:32:44,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:32:44,067 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:32:44,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:32:44,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:32:44,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:32:44,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:32:44,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:32:44,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:32:44,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:32:44,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:32:44,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2019-01-12 09:32:44,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:32:44,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:32:44,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:32:44,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:32:44,139 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:32:44,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-12 09:32:44,205 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d7179ea/012c76abfa1345dcaae67c374b90ab02/FLAGe58ab6771 [2019-01-12 09:32:44,662 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:32:44,663 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-12 09:32:44,669 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d7179ea/012c76abfa1345dcaae67c374b90ab02/FLAGe58ab6771 [2019-01-12 09:32:45,041 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d7179ea/012c76abfa1345dcaae67c374b90ab02 [2019-01-12 09:32:45,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:32:45,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:32:45,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:32:45,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:32:45,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:32:45,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45, skipping insertion in model container [2019-01-12 09:32:45,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:32:45,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:32:45,266 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:32:45,274 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:32:45,306 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:32:45,335 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:32:45,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45 WrapperNode [2019-01-12 09:32:45,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:32:45,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:32:45,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:32:45,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:32:45,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:32:45,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:32:45,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:32:45,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:32:45,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (1/1) ... [2019-01-12 09:32:45,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:32:45,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:32:45,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:32:45,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:32:45,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (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-01-12 09:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-12 09:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 09:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:32:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:32:46,140 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:32:46,141 INFO L286 CfgBuilder]: Removed 27 assue(true) statements. [2019-01-12 09:32:46,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:46 BoogieIcfgContainer [2019-01-12 09:32:46,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:32:46,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:32:46,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:32:46,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:32:46,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:32:45" (1/3) ... [2019-01-12 09:32:46,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c74ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:32:46, skipping insertion in model container [2019-01-12 09:32:46,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:45" (2/3) ... [2019-01-12 09:32:46,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c74ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:32:46, skipping insertion in model container [2019-01-12 09:32:46,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:46" (3/3) ... [2019-01-12 09:32:46,150 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-12 09:32:46,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:32:46,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 09:32:46,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 09:32:46,215 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:32:46,216 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:32:46,216 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:32:46,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:32:46,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:32:46,217 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:32:46,217 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:32:46,217 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:32:46,217 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:32:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-01-12 09:32:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:32:46,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:46,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:46,243 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash 409945024, now seen corresponding path program 1 times [2019-01-12 09:32:46,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:46,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:46,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:32:46,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:32:46,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:32:46,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:46,433 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-01-12 09:32:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:46,489 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2019-01-12 09:32:46,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:32:46,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-12 09:32:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:46,502 INFO L225 Difference]: With dead ends: 68 [2019-01-12 09:32:46,503 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 09:32:46,506 INFO L631 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-01-12 09:32:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 09:32:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-12 09:32:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:32:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-01-12 09:32:46,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2019-01-12 09:32:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:46,537 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-01-12 09:32:46,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:32:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-01-12 09:32:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:32:46,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:46,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:46,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1658708759, now seen corresponding path program 1 times [2019-01-12 09:32:46,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:46,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:46,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 09:32:46,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:32:46,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:32:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:32:46,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:46,625 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2019-01-12 09:32:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:46,772 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2019-01-12 09:32:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:32:46,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 09:32:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:46,776 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:32:46,776 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 09:32:46,777 INFO L631 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-01-12 09:32:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 09:32:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2019-01-12 09:32:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 09:32:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-01-12 09:32:46,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2019-01-12 09:32:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:46,785 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-12 09:32:46,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:32:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-01-12 09:32:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:32:46,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:46,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:46,788 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1382422530, now seen corresponding path program 1 times [2019-01-12 09:32:46,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:46,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:46,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:32:46,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:32:46,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:47,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:32:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:47,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:32:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 09:32:47,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:32:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:32:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:32:47,113 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 5 states. [2019-01-12 09:32:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:47,187 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-01-12 09:32:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:32:47,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-12 09:32:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:47,191 INFO L225 Difference]: With dead ends: 65 [2019-01-12 09:32:47,191 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:32:47,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:32:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:32:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 09:32:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 09:32:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-01-12 09:32:47,202 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2019-01-12 09:32:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:47,204 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-01-12 09:32:47,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:32:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-01-12 09:32:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:32:47,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:47,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:47,206 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1994936256, now seen corresponding path program 2 times [2019-01-12 09:32:47,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:47,929 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-12 09:32:48,100 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-01-12 09:32:48,388 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-12 09:32:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:32:48,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:32:48,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:32:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:32:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:32:48,395 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 11 states. [2019-01-12 09:32:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:49,202 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-01-12 09:32:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:32:49,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-01-12 09:32:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:49,205 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:32:49,206 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 09:32:49,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:32:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 09:32:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-01-12 09:32:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 09:32:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-01-12 09:32:49,216 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2019-01-12 09:32:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:49,217 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-01-12 09:32:49,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:32:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2019-01-12 09:32:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:32:49,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:49,219 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:49,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 902320519, now seen corresponding path program 1 times [2019-01-12 09:32:49,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:49,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:49,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:49,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:32:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:32:49,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:32:49,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:32:49,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:49,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:32:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:32:49,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:32:49,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 09:32:49,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:32:49,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:32:49,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:32:49,456 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 5 states. [2019-01-12 09:32:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:49,593 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2019-01-12 09:32:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:32:49,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 09:32:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:49,595 INFO L225 Difference]: With dead ends: 103 [2019-01-12 09:32:49,595 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 09:32:49,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-01-12 09:32:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 09:32:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2019-01-12 09:32:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:32:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-01-12 09:32:49,605 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2019-01-12 09:32:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:49,605 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-12 09:32:49,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:32:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-01-12 09:32:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:32:49,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:49,606 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:49,607 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2064717651, now seen corresponding path program 1 times [2019-01-12 09:32:49,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:50,103 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 14 [2019-01-12 09:32:50,836 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-01-12 09:32:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:51,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:32:51,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:32:51,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:51,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:32:51,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:32:51,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:32:51,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-12 09:32:51,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-12 09:32:51,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-12 09:32:51,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-12 09:32:51,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2019-01-12 09:32:51,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2019-01-12 09:32:51,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:32:51,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:32:51,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:51,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 09:32:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 09:32:51,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 09:32:51,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2019-01-12 09:32:51,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 09:32:51,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 09:32:51,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:32:51,948 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 20 states. [2019-01-12 09:32:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:54,487 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2019-01-12 09:32:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 09:32:54,488 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-01-12 09:32:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:54,491 INFO L225 Difference]: With dead ends: 120 [2019-01-12 09:32:54,492 INFO L226 Difference]: Without dead ends: 102 [2019-01-12 09:32:54,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=311, Invalid=1249, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 09:32:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-12 09:32:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 66. [2019-01-12 09:32:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 09:32:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2019-01-12 09:32:54,507 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 24 [2019-01-12 09:32:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:54,508 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2019-01-12 09:32:54,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 09:32:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2019-01-12 09:32:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:32:54,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:54,509 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:54,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -554343156, now seen corresponding path program 1 times [2019-01-12 09:32:54,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:54,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:54,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:54,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:32:54,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:32:54,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:32:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:55,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:32:55,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:32:55,145 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:32:55,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:32:55,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-12 09:32:55,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-12 09:32:55,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-12 09:32:55,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-12 09:32:55,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2019-01-12 09:32:55,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 1 [2019-01-12 09:32:55,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-12 09:32:55,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:32:55,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-12 09:32:55,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:55,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:32:55,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:28 [2019-01-12 09:32:56,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2019-01-12 09:32:56,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:32:56,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:32:56,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-01-12 09:32:56,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:32:56,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:56,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:32:56,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-01-12 09:32:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:32:56,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 09:32:56,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 15 [2019-01-12 09:32:56,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 09:32:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 09:32:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:32:56,143 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 16 states. [2019-01-12 09:33:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:00,645 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-01-12 09:33:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 09:33:00,646 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-01-12 09:33:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:00,648 INFO L225 Difference]: With dead ends: 157 [2019-01-12 09:33:00,648 INFO L226 Difference]: Without dead ends: 147 [2019-01-12 09:33:00,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-01-12 09:33:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-12 09:33:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2019-01-12 09:33:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 09:33:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2019-01-12 09:33:00,682 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 24 [2019-01-12 09:33:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:00,682 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2019-01-12 09:33:00,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 09:33:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2019-01-12 09:33:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:33:00,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:00,685 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:00,685 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash 93482631, now seen corresponding path program 1 times [2019-01-12 09:33:00,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:00,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:00,910 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:33:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:01,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:01,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:01,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:01,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:33:01,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-12 09:33:01,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:01,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:01,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:01,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-12 09:33:01,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:33:01,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:01,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:01,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:01,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 09:33:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:01,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:01,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-01-12 09:33:01,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 09:33:01,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 09:33:01,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:33:01,703 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 20 states. [2019-01-12 09:33:06,705 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-01-12 09:33:07,156 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-01-12 09:33:07,505 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-01-12 09:33:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:09,541 INFO L93 Difference]: Finished difference Result 299 states and 386 transitions. [2019-01-12 09:33:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-12 09:33:09,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-01-12 09:33:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:09,546 INFO L225 Difference]: With dead ends: 299 [2019-01-12 09:33:09,546 INFO L226 Difference]: Without dead ends: 260 [2019-01-12 09:33:09,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1313, Invalid=5659, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 09:33:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-12 09:33:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 136. [2019-01-12 09:33:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-12 09:33:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2019-01-12 09:33:09,573 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 27 [2019-01-12 09:33:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:09,573 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2019-01-12 09:33:09,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 09:33:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2019-01-12 09:33:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:33:09,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:09,575 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:09,575 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2029788007, now seen corresponding path program 1 times [2019-01-12 09:33:09,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:09,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:09,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:09,853 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:33:10,007 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:33:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:10,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:10,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:10,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:10,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:10,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:33:10,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:33:10,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-12 09:33:10,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-12 09:33:10,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-12 09:33:10,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-12 09:33:10,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-01-12 09:33:10,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:13 [2019-01-12 09:33:10,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:10,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:33:10,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:10,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 09:33:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-01-12 09:33:10,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 09:33:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 09:33:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:33:10,812 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand 21 states. [2019-01-12 09:33:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:13,122 INFO L93 Difference]: Finished difference Result 287 states and 353 transitions. [2019-01-12 09:33:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 09:33:13,123 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-01-12 09:33:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:13,125 INFO L225 Difference]: With dead ends: 287 [2019-01-12 09:33:13,126 INFO L226 Difference]: Without dead ends: 239 [2019-01-12 09:33:13,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 09:33:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-12 09:33:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 135. [2019-01-12 09:33:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-12 09:33:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2019-01-12 09:33:13,164 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 27 [2019-01-12 09:33:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:13,164 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2019-01-12 09:33:13,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 09:33:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2019-01-12 09:33:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:33:13,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:13,169 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:13,169 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1387129824, now seen corresponding path program 1 times [2019-01-12 09:33:13,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:13,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:13,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:13,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:13,771 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-12 09:33:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:14,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:14,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:14,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:14,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:33:14,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:33:14,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-12 09:33:14,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2019-01-12 09:33:14,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2019-01-12 09:33:14,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-12 09:33:14,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 1 [2019-01-12 09:33:14,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:28 [2019-01-12 09:33:14,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2019-01-12 09:33:14,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:33:14,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:33:14,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-12 09:33:14,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-01-12 09:33:14,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:14,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:60, output treesize:30 [2019-01-12 09:33:15,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2019-01-12 09:33:15,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:33:15,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-12 09:33:15,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2019-01-12 09:33:15,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2019-01-12 09:33:15,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:14 [2019-01-12 09:33:15,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:15,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:33:15,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:15,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-12 09:33:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 09:33:15,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:15,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 30 [2019-01-12 09:33:15,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 09:33:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 09:33:15,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2019-01-12 09:33:15,421 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 31 states. [2019-01-12 09:33:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:16,663 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2019-01-12 09:33:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 09:33:16,664 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 29 [2019-01-12 09:33:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:16,665 INFO L225 Difference]: With dead ends: 184 [2019-01-12 09:33:16,665 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 09:33:16,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 09:33:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 09:33:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-12 09:33:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:33:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2019-01-12 09:33:16,682 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 29 [2019-01-12 09:33:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:16,682 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2019-01-12 09:33:16,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 09:33:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2019-01-12 09:33:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 09:33:16,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:16,686 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:16,686 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:16,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2028220957, now seen corresponding path program 1 times [2019-01-12 09:33:16,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:16,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 09:33:16,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:16,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:16,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:16,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 09:33:16,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:16,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 09:33:16,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:33:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:33:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:33:16,912 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand 5 states. [2019-01-12 09:33:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:17,036 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2019-01-12 09:33:17,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:33:17,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 09:33:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:17,037 INFO L225 Difference]: With dead ends: 96 [2019-01-12 09:33:17,037 INFO L226 Difference]: Without dead ends: 84 [2019-01-12 09:33:17,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:33:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-12 09:33:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-01-12 09:33:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-12 09:33:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-01-12 09:33:17,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 33 [2019-01-12 09:33:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:17,058 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-01-12 09:33:17,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:33:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-01-12 09:33:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 09:33:17,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:17,067 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:17,067 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash 591619839, now seen corresponding path program 1 times [2019-01-12 09:33:17,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:17,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 09:33:18,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:18,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:18,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:18,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:33:18,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:33:18,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-12 09:33:18,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-12 09:33:18,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2019-01-12 09:33:18,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:14 [2019-01-12 09:33:18,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:18,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:33:18,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:18,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-12 09:33:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 09:33:18,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:18,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 29 [2019-01-12 09:33:18,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-12 09:33:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-12 09:33:18,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2019-01-12 09:33:18,709 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 30 states. [2019-01-12 09:33:19,485 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-01-12 09:33:19,804 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-01-12 09:33:20,008 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2019-01-12 09:33:20,318 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 09:33:20,458 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-01-12 09:33:20,652 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-01-12 09:33:20,798 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-01-12 09:33:21,029 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-01-12 09:33:21,218 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-01-12 09:33:21,361 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-01-12 09:33:21,653 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-01-12 09:33:21,971 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-01-12 09:33:22,158 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-01-12 09:33:22,369 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-01-12 09:33:22,516 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-12 09:33:22,696 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-01-12 09:33:22,937 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-01-12 09:33:23,119 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-01-12 09:33:23,267 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-01-12 09:33:23,411 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-01-12 09:33:23,673 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-01-12 09:33:24,009 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-01-12 09:33:24,205 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-01-12 09:33:24,429 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-01-12 09:33:24,621 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2019-01-12 09:33:24,783 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-01-12 09:33:25,005 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-01-12 09:33:25,256 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-01-12 09:33:25,508 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-01-12 09:33:25,689 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-01-12 09:33:25,873 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-01-12 09:33:26,087 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-01-12 09:33:26,276 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-01-12 09:33:26,438 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-01-12 09:33:26,626 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-01-12 09:33:26,815 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 57 [2019-01-12 09:33:27,327 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-01-12 09:33:27,569 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-01-12 09:33:27,782 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-01-12 09:33:28,171 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-01-12 09:33:28,332 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-01-12 09:33:28,512 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-01-12 09:33:28,702 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-01-12 09:33:28,946 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-01-12 09:33:29,106 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-01-12 09:33:29,270 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2019-01-12 09:33:29,562 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-01-12 09:33:29,758 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2019-01-12 09:33:29,932 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-01-12 09:33:30,131 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-01-12 09:33:30,324 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-12 09:33:30,684 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-01-12 09:33:30,950 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-12 09:33:31,130 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-01-12 09:33:31,304 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-01-12 09:33:31,509 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-01-12 09:33:31,817 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-01-12 09:33:32,026 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-01-12 09:33:32,275 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-01-12 09:33:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:32,926 INFO L93 Difference]: Finished difference Result 224 states and 259 transitions. [2019-01-12 09:33:32,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-12 09:33:32,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-01-12 09:33:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:32,930 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:33:32,930 INFO L226 Difference]: Without dead ends: 210 [2019-01-12 09:33:32,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3225 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=2301, Invalid=9041, Unknown=0, NotChecked=0, Total=11342 [2019-01-12 09:33:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-12 09:33:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 88. [2019-01-12 09:33:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 09:33:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2019-01-12 09:33:32,958 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 34 [2019-01-12 09:33:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:32,958 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-01-12 09:33:32,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-12 09:33:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2019-01-12 09:33:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 09:33:32,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:32,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:32,960 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:32,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1713878490, now seen corresponding path program 1 times [2019-01-12 09:33:32,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:32,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:32,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:32,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:32,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 09:33:33,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:33,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:33,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:33,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:33,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:33:33,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:33:33,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-12 09:33:33,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-12 09:33:33,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-12 09:33:33,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-12 09:33:33,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2019-01-12 09:33:33,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-12 09:33:33,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-12 09:33:33,649 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-12 09:33:33,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2019-01-12 09:33:33,669 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,687 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:79, output treesize:27 [2019-01-12 09:33:33,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:33,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-12 09:33:33,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:33,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:33:33,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:33,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2019-01-12 09:33:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 09:33:33,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:33,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-01-12 09:33:33,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 09:33:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 09:33:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:33:33,858 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 20 states. [2019-01-12 09:33:35,157 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-01-12 09:33:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:35,213 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2019-01-12 09:33:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 09:33:35,214 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-01-12 09:33:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:35,215 INFO L225 Difference]: With dead ends: 114 [2019-01-12 09:33:35,216 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 09:33:35,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 09:33:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 09:33:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-12 09:33:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 09:33:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-01-12 09:33:35,235 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 37 [2019-01-12 09:33:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:35,236 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-01-12 09:33:35,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 09:33:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-01-12 09:33:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 09:33:35,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:35,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:35,237 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1276662955, now seen corresponding path program 1 times [2019-01-12 09:33:35,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:35,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:35,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:35,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:35,525 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2019-01-12 09:33:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 09:33:36,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:36,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:36,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:36,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:36,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:33:36,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:33:36,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-12 09:33:36,902 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 09:33:36,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-12 09:33:36,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-12 09:33:36,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-12 09:33:36,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-01-12 09:33:36,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:36,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:23 [2019-01-12 09:33:37,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-01-12 09:33:37,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:33:37,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:33:37,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2019-01-12 09:33:37,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2019-01-12 09:33:37,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:23 [2019-01-12 09:33:37,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-12 09:33:37,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-01-12 09:33:37,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:19 [2019-01-12 09:33:37,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:33:37,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2019-01-12 09:33:37,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:33:37,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-12 09:33:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:33:37,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:33:37,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2019-01-12 09:33:37,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 09:33:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 09:33:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2019-01-12 09:33:37,559 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 28 states. [2019-01-12 09:33:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:38,962 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-01-12 09:33:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 09:33:38,963 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-01-12 09:33:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:38,963 INFO L225 Difference]: With dead ends: 88 [2019-01-12 09:33:38,964 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 09:33:38,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=256, Invalid=1550, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 09:33:38,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 09:33:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-01-12 09:33:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 09:33:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-01-12 09:33:38,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 39 [2019-01-12 09:33:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:38,976 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-01-12 09:33:38,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 09:33:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-01-12 09:33:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 09:33:38,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:38,977 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:38,977 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1008598199, now seen corresponding path program 1 times [2019-01-12 09:33:38,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:38,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:38,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:38,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 09:33:39,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:33:39,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:33:39,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:39,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:33:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 09:33:39,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 09:33:39,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-01-12 09:33:39,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:33:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:33:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:33:39,137 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 6 states. [2019-01-12 09:33:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:39,193 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-01-12 09:33:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:33:39,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-01-12 09:33:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:39,194 INFO L225 Difference]: With dead ends: 77 [2019-01-12 09:33:39,194 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:33:39,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:33:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:33:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:33:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:33:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:33:39,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-01-12 09:33:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:39,196 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:33:39,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:33:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:33:39,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:33:39,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:33:39,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:33:39,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:33:39,362 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 154 [2019-01-12 09:33:39,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:33:39,989 WARN L181 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 256 [2019-01-12 09:33:40,804 WARN L181 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-01-12 09:33:41,987 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-01-12 09:33:45,751 WARN L181 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 148 DAG size of output: 91 [2019-01-12 09:33:46,140 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-01-12 09:33:48,873 WARN L181 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 256 DAG size of output: 101 [2019-01-12 09:33:49,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-01-12 09:33:49,052 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 42) no Hoare annotation was computed. [2019-01-12 09:33:49,053 INFO L444 ceAbstractionStarter]: At program point L36-3(lines 36 42) the Hoare annotation is: (let ((.cse12 (* 4 ULTIMATE.start_f_~i~1)) (.cse22 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse11 (+ |~#pstate~0.offset| 4))) (let ((.cse25 (select |#memory_int| |~#pstate~0.base|)) (.cse20 (select .cse22 .cse11)) (.cse24 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse26 (+ |~#pp~0.offset| .cse12))) (let ((.cse16 (<= .cse26 7)) (.cse13 (= 1 (select .cse24 |~#pp~0.offset|))) (.cse0 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse18 (= .cse11 .cse26)) (.cse1 (= (select .cse24 .cse11) ULTIMATE.start_main_~b~0.offset)) (.cse2 (= .cse20 ULTIMATE.start_main_~a~0.base)) (.cse3 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse4 (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (.cse15 (= 0 ULTIMATE.start_main_~a~0.base)) (.cse5 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base)) (.cse6 (= ULTIMATE.start_f_~pointer.offset ULTIMATE.start_main_~b~0.offset)) (.cse7 (= 0 |ULTIMATE.start_malloc_#res.base|)) (.cse19 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse21 (= 1 (select .cse25 0))) (.cse9 (= |~#pp~0.offset| 0)) (.cse10 (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0)) (.cse8 (= 1 (select .cse25 .cse11))) (.cse23 (+ |~#pp~0.offset| (* 4 ULTIMATE.start_g_~i~2))) (.cse14 (<= 0 |~#pstate~0.offset|)) (.cse17 (not (= |~#pp~0.base| |~#pstate~0.base|)))) (or (and (<= 2 ULTIMATE.start_g_~i~2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 (<= .cse11 .cse12) (<= (+ ULTIMATE.start_main_~a~0.offset 1) ULTIMATE.start_f_~pointer.offset)) .cse13) .cse14 .cse15 (<= 1 ULTIMATE.start_main_~a~0.offset) .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse4 .cse19 (= ULTIMATE.start_g_~pointer.offset 1) .cse9 (= ULTIMATE.start_g_~pointer.base .cse20) .cse10 .cse0 .cse3 .cse21 .cse8 .cse15 .cse5 (= 0 ULTIMATE.start_g_~i~2) .cse6 .cse7 .cse14 .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse4 (and (= ULTIMATE.start_g_~pointer.base (select .cse22 .cse23)) (= ULTIMATE.start_g_~pointer.offset (select .cse24 0))) .cse19 .cse9 .cse10 .cse0 .cse3 .cse8 .cse15 .cse5 .cse6 .cse7 .cse14 (= 1 ULTIMATE.start_g_~i~2) .cse16 .cse13 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 (and (and (or (not (= ULTIMATE.start_g_~pointer.offset (select .cse24 .cse23))) (not (= .cse11 .cse23))) (and (<= |~#pstate~0.offset| 0) .cse19 .cse21) .cse9 .cse10 .cse8 (<= .cse11 .cse23)) .cse14 .cse17)))))) [2019-01-12 09:33:49,053 INFO L448 ceAbstractionStarter]: For program point L36-6(lines 36 42) no Hoare annotation was computed. [2019-01-12 09:33:49,053 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:33:49,056 INFO L444 ceAbstractionStarter]: At program point L36-7(lines 36 42) the Hoare annotation is: (let ((.cse27 (* 4 ULTIMATE.start_f_~i~1)) (.cse26 (+ |~#pstate~0.offset| 4))) (let ((.cse21 (select |#memory_int| |~#pstate~0.base|)) (.cse25 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse26)) (.cse24 (+ |~#pp~0.offset| .cse27)) (.cse28 (+ ULTIMATE.start_main_~a~0.offset 1)) (.cse23 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse29 (+ |~#pp~0.offset| (* 4 ULTIMATE.start_g_~i~2)))) (let ((.cse15 (or (not (= ULTIMATE.start_g_~pointer.offset (select .cse23 .cse29))) (not (= .cse26 .cse29)))) (.cse18 (<= .cse28 ULTIMATE.start_f_~pointer.offset)) (.cse16 (<= .cse28 |ULTIMATE.start_malloc_#res.offset|)) (.cse19 (<= .cse26 .cse29)) (.cse1 (= .cse26 .cse24)) (.cse0 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse2 (= (select .cse23 .cse26) ULTIMATE.start_main_~b~0.offset)) (.cse3 (= .cse25 ULTIMATE.start_main_~a~0.base)) (.cse4 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse5 (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (.cse6 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base)) (.cse7 (= ULTIMATE.start_f_~pointer.offset ULTIMATE.start_main_~b~0.offset)) (.cse11 (= 0 |ULTIMATE.start_malloc_#res.base|)) (.cse8 (and (<= 1 ~counter~0) (<= |~#pstate~0.offset| 0) (<= .cse28 ULTIMATE.start_main_~b~0.offset) (= ULTIMATE.start_main_~a~0.offset 1) (= 0 |~#pp~0.offset|))) (.cse9 (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0)) (.cse10 (= 1 (select .cse21 .cse26))) (.cse17 (<= .cse26 .cse27)) (.cse20 (= ULTIMATE.start_g_~pointer.base .cse25)) (.cse13 (= 0 ULTIMATE.start_main_~a~0.base)) (.cse12 (<= 0 |~#pstate~0.offset|)) (.cse22 (<= .cse24 7)) (.cse14 (not (= |~#pp~0.base| |~#pstate~0.base|)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11) (<= 1 ULTIMATE.start_g_~i~2) .cse12 .cse13 .cse14) (and .cse15 .cse8 .cse16 .cse9 .cse10 .cse17 .cse12 (or (not .cse1) .cse18) .cse14 .cse19) (and .cse15 (= ULTIMATE.start_f_~i~1 0) .cse18 .cse8 .cse16 .cse9 .cse10 .cse12 .cse14 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse11 (and .cse9 (and (= ULTIMATE.start_g_~i~2 0) (<= 1 ULTIMATE.start_f_~i~1) (= 1 (select .cse21 0)) .cse8) .cse10) .cse14) (and (<= 2 ULTIMATE.start_g_~i~2) (and (= |ULTIMATE.start_malloc_#res.base| ULTIMATE.start_main_~a~0.base) .cse0 (and .cse7 .cse6) .cse11 (and .cse8 .cse9) .cse4 .cse5 .cse17) .cse12 .cse22 .cse14) (and (and .cse0 (= ULTIMATE.start_g_~pointer.offset 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 (and (= 0 ULTIMATE.start_g_~i~2) .cse8 .cse9 .cse10 .cse17) .cse20 (= 1 (select .cse23 |~#pp~0.offset|))) .cse13 .cse12 .cse22 .cse14))))) [2019-01-12 09:33:49,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:33:49,056 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-01-12 09:33:49,056 INFO L448 ceAbstractionStarter]: For program point L4(lines 1 69) no Hoare annotation was computed. [2019-01-12 09:33:49,057 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-01-12 09:33:49,057 INFO L448 ceAbstractionStarter]: For program point L4-1(lines 1 69) no Hoare annotation was computed. [2019-01-12 09:33:49,057 INFO L444 ceAbstractionStarter]: At program point L47(lines 46 49) the Hoare annotation is: (let ((.cse1 (+ |~#pstate~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 .cse1)) (<= |~#pstate~0.offset| 0) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (<= 1 |ULTIMATE.start_malloc_#res.offset|) (= 0 (select .cse2 .cse1)) (= ~counter~0 2) (= 0 (select .cse0 0)) (= |ULTIMATE.start_malloc_#res.base| 0) (= |~#pp~0.offset| 0) (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0) (= 0 (select .cse2 |~#pp~0.offset|)) (<= 0 |~#pstate~0.offset|) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2019-01-12 09:33:49,057 INFO L444 ceAbstractionStarter]: At program point L47-1(lines 46 49) the Hoare annotation is: (let ((.cse1 (+ |~#pstate~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |ULTIMATE.start_malloc_#res.offset| 2) (= 0 (select .cse0 .cse1)) (<= |~#pstate~0.offset| 0) (= 0 ULTIMATE.start_main_~a~0.base) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (= 0 (select .cse2 (+ |~#pp~0.offset| 4))) (= 0 |ULTIMATE.start_malloc_#res.base|) (= ULTIMATE.start_main_~a~0.offset 1) (= 0 (select .cse0 0)) (= |~#pp~0.offset| 0) (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0) (= 0 (select .cse2 |~#pp~0.offset|)) (<= 0 |~#pstate~0.offset|) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2019-01-12 09:33:49,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-01-12 09:33:49,057 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 09:33:49,057 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-01-12 09:33:49,057 INFO L448 ceAbstractionStarter]: For program point L39-2(line 39) no Hoare annotation was computed. [2019-01-12 09:33:49,058 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:33:49,061 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 25 31) no Hoare annotation was computed. [2019-01-12 09:33:49,062 INFO L444 ceAbstractionStarter]: At program point L25-3(lines 25 31) the Hoare annotation is: (let ((.cse0 (* 4 ULTIMATE.start_f_~i~1)) (.cse2 (+ |~#pstate~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (+ |~#pstate~0.offset| .cse0)) (= |ULTIMATE.start_malloc_#res.offset| 2) (= ULTIMATE.start_f_~i~1 0) (= ULTIMATE.start_main_~b~0.offset 2) (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base) (= 0 ULTIMATE.start_main_~a~0.base) (= 0 (select (store .cse1 (+ |~#pp~0.offset| .cse0) ULTIMATE.start_f_~pointer.base) .cse2)) (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse2 (- |~#pp~0.offset|)) 4) 1)) (= 0 (select .cse3 (+ |~#pp~0.offset| 4))) (= 0 |ULTIMATE.start_malloc_#res.base|) (= ULTIMATE.start_main_~a~0.offset 1) (= 0 (select .cse1 0)) (= |~#pp~0.offset| 0) (= 1 ULTIMATE.start_f_~pointer.offset) (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0) (= 0 (select .cse3 |~#pp~0.offset|)) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2019-01-12 09:33:49,062 INFO L448 ceAbstractionStarter]: For program point L25-6(lines 25 31) no Hoare annotation was computed. [2019-01-12 09:33:49,062 INFO L444 ceAbstractionStarter]: At program point L25-7(lines 25 31) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse13 (+ |~#pstate~0.offset| 4)) (.cse20 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (.cse18 (select .cse20 |~#pp~0.offset|)) (.cse1 (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse13 (- |~#pp~0.offset|)) 4) 1))) (.cse2 (= 0 (select .cse20 .cse13))) (.cse3 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse4 (= |~#pp~0.offset| 0)) (.cse5 (= (select .cse11 ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.base)) (.cse6 (<= (+ |ULTIMATE.start_malloc_#res.offset| 1) ~counter~0)) (.cse7 (= |ULTIMATE.start_malloc_#res.offset| 2)) (.cse8 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse9 (= 1 (select (select |#memory_int| |~#pstate~0.base|) 0))) (.cse10 (= 0 ULTIMATE.start_main_~a~0.base)) (.cse14 (= ULTIMATE.start_f_~pointer.base ULTIMATE.start_main_~a~0.base)) (.cse15 (= ULTIMATE.start_f_~pointer.offset ULTIMATE.start_main_~b~0.offset)) (.cse16 (= 0 |ULTIMATE.start_malloc_#res.base|)) (.cse17 (<= 0 |~#pstate~0.offset|)) (.cse12 (+ |~#pp~0.offset| (* 4 ULTIMATE.start_f_~i~1))) (.cse19 (not (= |~#pp~0.base| |~#pstate~0.base|)))) (or (and (<= |~#pstate~0.offset| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_f_~i~1 0) .cse8 .cse9 .cse10 (= 0 (select (store .cse11 .cse12 ULTIMATE.start_f_~pointer.base) .cse13)) .cse14 .cse15 .cse16 .cse17 (= 1 .cse18) .cse19) (and (= 0 (select .cse11 .cse13)) (= .cse13 .cse12) .cse0 (= ULTIMATE.start_main_~a~0.offset .cse18) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse17 (<= .cse12 7) .cse19)))) [2019-01-12 09:33:49,062 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 20) no Hoare annotation was computed. [2019-01-12 09:33:49,062 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse1 (+ |~#pstate~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 .cse1)) (<= ULTIMATE.start_init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (<= |~#pstate~0.offset| 0) (= 0 (select .cse2 .cse1)) (= 0 (select .cse0 0)) (= |~#pp~0.offset| 0) (= ~counter~0 1) (= 0 (select .cse2 |~#pp~0.offset|)) (<= 0 |~#pstate~0.offset|) (not (= |~#pp~0.base| |~#pstate~0.base|)))) [2019-01-12 09:33:49,062 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 43) no Hoare annotation was computed. [2019-01-12 09:33:49,062 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2019-01-12 09:33:49,062 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2019-01-12 09:33:49,063 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2019-01-12 09:33:49,063 INFO L451 ceAbstractionStarter]: At program point L68(lines 51 69) the Hoare annotation is: true [2019-01-12 09:33:49,081 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,091 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,095 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,098 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,102 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,109 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,116 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,119 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,120 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,121 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,121 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,121 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,133 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,133 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,133 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,137 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,137 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,138 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,138 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,138 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,140 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,141 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,141 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,143 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,145 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,146 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,146 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,146 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,150 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,163 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,164 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,164 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,165 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,165 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,165 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,165 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,168 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,170 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,172 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,177 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,177 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,177 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,178 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,179 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,180 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,180 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,180 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,191 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,191 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,192 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,192 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,192 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,202 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,204 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,204 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,204 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,223 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,223 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,223 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,224 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,225 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,225 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,225 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,226 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,229 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,229 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,230 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,230 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,232 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:33:49 BoogieIcfgContainer [2019-01-12 09:33:49,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:33:49,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:33:49,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:33:49,236 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:33:49,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:46" (3/4) ... [2019-01-12 09:33:49,242 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:33:49,259 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-12 09:33:49,260 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 09:33:49,304 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate <= 0) && i <= (pstate + 4 + -pp) / 4 + 1) && 1 <= \result) && 0 == #memory_$Pointer$[pp][pstate + 4]) && counter == 2) && 0 == #memory_$Pointer$[pp][0]) && \result == 0) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) [2019-01-12 09:33:49,305 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 2 && 0 == #memory_$Pointer$[pp][pstate + 4]) && pstate <= 0) && 0 == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) [2019-01-12 09:33:49,306 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pstate + 4 * i && \result == 2) && i == 0) && b == 2) && b == a) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && 1 == pointer) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && !(pp == pstate) [2019-01-12 09:33:49,306 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((pstate <= 0 && b == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && i == 0) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate)) || (((((((((((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate + 4 == pp + 4 * i) && b == a) && a == #memory_$Pointer$[pp][pp]) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) [2019-01-12 09:33:49,307 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= i && ((((((((\result == 2 && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((1 == unknown-#memory_int-unknown[pstate][pstate + 4] && pp == 0) && \result + 1 <= counter) && pstate + 4 <= 4 * i) && a + 1 <= pointer) && 1 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && 0 == a) && 1 <= a) && pp + 4 * i <= 7) && !(pp == pstate)) || ((((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && a == 1) && pointer == 1) && pp == 0) && pointer == #memory_$Pointer$[pp][pstate + 4]) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && 0 == i) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && pointer == #memory_$Pointer$[pp][pp + 4 * i] && pointer == #memory_$Pointer$[pp][0]) && a == 1) && pp == 0) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == i) && pp + 4 * i <= 7) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate))) || ((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (pstate <= 0 && a == 1) && 1 == unknown-#memory_int-unknown[pstate][0]) && pp == 0) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= pp + 4 * i) && 0 <= pstate) && !(pp == pstate)) [2019-01-12 09:33:49,307 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && (((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == \result) && 1 <= i) && 0 <= pstate) && 0 == a) && !(pp == pstate)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && 0 <= pstate) && (!(pstate + 4 == pp + 4 * i) || a + 1 <= pointer)) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && i == 0) && a + 1 <= pointer) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 <= pstate) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((((\result == 2 && pointer == #memory_$Pointer$[pp][pstate + 4]) && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (\result + 1 <= counter && ((i == 0 && 1 <= i) && 1 == unknown-#memory_int-unknown[pstate][0]) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && !(pp == pstate))) || ((((2 <= i && ((((((\result == a && \result == 2) && pointer == b && pointer == a) && 0 == \result) && ((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && b == 2) && b == a) && pstate + 4 <= 4 * i) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((\result == 2 && pointer == 2) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((0 == i && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && pointer == #memory_$Pointer$[pp][pstate + 4]) && 1 == #memory_$Pointer$[pp][pp]) && 0 == a) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) [2019-01-12 09:33:49,350 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:33:49,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:33:49,351 INFO L168 Benchmark]: Toolchain (without parser) took 64305.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 488.1 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -282.2 MB). Peak memory consumption was 206.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:49,351 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:33:49,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.69 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:49,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:49,355 INFO L168 Benchmark]: Boogie Preprocessor took 103.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:49,356 INFO L168 Benchmark]: RCFGBuilder took 642.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:49,356 INFO L168 Benchmark]: TraceAbstraction took 63092.60 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.0 MB). Peak memory consumption was 633.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:33:49,358 INFO L168 Benchmark]: Witness Printer took 113.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:33:49,362 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.69 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 642.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63092.60 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.0 MB). Peak memory consumption was 633.9 MB. Max. memory is 11.5 GB. * Witness Printer took 113.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 - 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$.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$.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 - 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$.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 - 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$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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_$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_$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_$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_$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_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_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_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_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_$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_$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_int - 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_int - 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_int - 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_int - 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_$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_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant [2019-01-12 09:33:49,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,388 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,389 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate <= 0) && i <= (pstate + 4 + -pp) / 4 + 1) && 1 <= \result) && 0 == #memory_$Pointer$[pp][pstate + 4]) && counter == 2) && 0 == #memory_$Pointer$[pp][0]) && \result == 0) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) - InvariantResult [Line: 25]: Loop Invariant [2019-01-12 09:33:49,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((((((0 == pstate + 4 * i && \result == 2) && i == 0) && b == 2) && b == a) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && 1 == pointer) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && !(pp == pstate) - InvariantResult [Line: 36]: Loop Invariant [2019-01-12 09:33:49,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,411 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,411 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,414 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,415 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,420 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,420 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,420 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,420 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,421 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,422 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((2 <= i && ((((((((\result == 2 && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((1 == unknown-#memory_int-unknown[pstate][pstate + 4] && pp == 0) && \result + 1 <= counter) && pstate + 4 <= 4 * i) && a + 1 <= pointer) && 1 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && 0 == a) && 1 <= a) && pp + 4 * i <= 7) && !(pp == pstate)) || ((((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && a == 1) && pointer == 1) && pp == 0) && pointer == #memory_$Pointer$[pp][pstate + 4]) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && 0 == i) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((((((pstate + 4 == pp + 4 * i && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == a) && pointer == #memory_$Pointer$[pp][pp + 4 * i] && pointer == #memory_$Pointer$[pp][0]) && a == 1) && pp == 0) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == i) && pp + 4 * i <= 7) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate))) || ((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (pstate <= 0 && a == 1) && 1 == unknown-#memory_int-unknown[pstate][0]) && pp == 0) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= pp + 4 * i) && 0 <= pstate) && !(pp == pstate)) - InvariantResult [Line: 25]: Loop Invariant [2019-01-12 09:33:49,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,432 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,441 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,441 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,441 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((((((pstate <= 0 && b == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && i == 0) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && 0 == #memory_$Pointer$[pp][pp + 4 * i := pointer][pstate + 4]) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && 1 == #memory_$Pointer$[pp][pp]) && !(pp == pstate)) || (((((((((((((((((((0 == #memory_$Pointer$[pp][pstate + 4] && pstate + 4 == pp + 4 * i) && b == a) && a == #memory_$Pointer$[pp][pp]) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pstate + 4]) && a == 1) && pp == 0) && #memory_$Pointer$[pp][a] == a) && \result + 1 <= counter) && \result == 2) && b == 2) && 1 == unknown-#memory_int-unknown[pstate][0]) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) - InvariantResult [Line: 36]: Loop Invariant [2019-01-12 09:33:49,442 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,442 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,442 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,444 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,444 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,444 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,445 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,449 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,450 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,451 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,452 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,452 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,455 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,456 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:33:49,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((((((\result == 2 && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && (((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 == \result) && 1 <= i) && 0 <= pstate) && 0 == a) && !(pp == pstate)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && 0 <= pstate) && (!(pstate + 4 == pp + 4 * i) || a + 1 <= pointer)) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((!(pointer == #memory_$Pointer$[pp][pp + 4 * i]) || !(pstate + 4 == pp + 4 * i)) && i == 0) && a + 1 <= pointer) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && a + 1 <= \result) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && 0 <= pstate) && !(pp == pstate)) && pstate + 4 <= pp + 4 * i)) || ((((((((((((\result == 2 && pointer == #memory_$Pointer$[pp][pstate + 4]) && pstate + 4 == pp + 4 * i) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && 0 == a) && pointer == a) && pointer == b) && 0 == \result) && (\result + 1 <= counter && ((i == 0 && 1 <= i) && 1 == unknown-#memory_int-unknown[pstate][0]) && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && !(pp == pstate))) || ((((2 <= i && ((((((\result == a && \result == 2) && pointer == b && pointer == a) && 0 == \result) && ((((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && b == 2) && b == a) && pstate + 4 <= 4 * i) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate))) || (((((((((((((((\result == 2 && pointer == 2) && #memory_$Pointer$[pp][pstate + 4] == b) && #memory_$Pointer$[pp][pstate + 4] == a) && b == 2) && b == a) && pointer == a) && pointer == b) && 0 == \result) && (((0 == i && (((1 <= counter && pstate <= 0) && a + 1 <= b) && a == 1) && 0 == pp) && \result + 1 <= counter) && 1 == unknown-#memory_int-unknown[pstate][pstate + 4]) && pstate + 4 <= 4 * i) && pointer == #memory_$Pointer$[pp][pstate + 4]) && 1 == #memory_$Pointer$[pp][pp]) && 0 == a) && 0 <= pstate) && pp + 4 * i <= 7) && !(pp == pstate)) - InvariantResult [Line: 46]: Loop Invariant [2019-01-12 09:33:49,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,462 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((\result == 2 && 0 == #memory_$Pointer$[pp][pstate + 4]) && pstate <= 0) && 0 == a) && i <= (pstate + 4 + -pp) / 4 + 1) && 0 == #memory_$Pointer$[pp][pp + 4]) && 0 == \result) && a == 1) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && \result + 1 <= counter) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) - InvariantResult [Line: 17]: Loop Invariant [2019-01-12 09:33:49,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,466 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 09:33:49,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 09:33:49,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 09:33:49,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((0 == #memory_$Pointer$[pp][pstate + 4] && i <= (pstate + 4 + -pp) / 4 + 1) && pstate <= 0) && 0 == #memory_$Pointer$[pp][pstate + 4]) && 0 == #memory_$Pointer$[pp][0]) && pp == 0) && counter == 1) && 0 == #memory_$Pointer$[pp][pp]) && 0 <= pstate) && !(pp == pstate) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 2 error locations. SAFE Result, 62.8s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 36.9s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 2902 SDslu, 2640 SDs, 0 SdLazy, 4781 SolverSat, 1408 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 286 SyntacticMatches, 20 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6713 ImplicationChecksByTransitivity, 35.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 549 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 30 NumberOfFragments, 1533 HoareAnnotationTreeSize, 8 FomulaSimplifications, 20386860 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1790545 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 738 ConstructedInterpolants, 3 QuantifiedInterpolants, 264676 SizeOfPredicates, 100 NumberOfNonLiveVariables, 2076 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 149/239 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...