./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-data/shared_mem2_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/heap-data/shared_mem2_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 ebbfaff6f87d2f170bbf62930cb63938c92c4b2b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-14 16:50:43,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 16:50:43,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 16:50:43,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 16:50:43,988 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 16:50:43,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 16:50:43,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 16:50:43,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 16:50:43,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 16:50:43,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 16:50:43,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 16:50:44,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 16:50:44,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 16:50:44,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 16:50:44,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 16:50:44,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 16:50:44,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 16:50:44,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 16:50:44,010 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 16:50:44,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 16:50:44,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 16:50:44,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 16:50:44,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 16:50:44,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 16:50:44,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 16:50:44,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 16:50:44,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 16:50:44,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 16:50:44,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 16:50:44,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 16:50:44,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 16:50:44,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 16:50:44,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 16:50:44,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 16:50:44,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 16:50:44,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 16:50:44,028 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 16:50:44,043 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 16:50:44,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 16:50:44,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 16:50:44,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 16:50:44,045 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 16:50:44,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 16:50:44,046 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 16:50:44,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 16:50:44,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 16:50:44,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 16:50:44,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 16:50:44,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 16:50:44,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 16:50:44,047 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 16:50:44,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 16:50:44,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 16:50:44,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 16:50:44,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 16:50:44,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 16:50:44,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 16:50:44,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:50:44,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 16:50:44,050 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 16:50:44,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 16:50:44,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 16:50:44,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 16:50:44,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 16:50:44,051 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 -> ebbfaff6f87d2f170bbf62930cb63938c92c4b2b [2019-01-14 16:50:44,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 16:50:44,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 16:50:44,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 16:50:44,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 16:50:44,114 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 16:50:44,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-data/shared_mem2_true-unreach-call.i [2019-01-14 16:50:44,173 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c03ab8b/da1816d6e68348d5be856ed432abfcfc/FLAG80ac660a5 [2019-01-14 16:50:44,667 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 16:50:44,668 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-data/shared_mem2_true-unreach-call.i [2019-01-14 16:50:44,687 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c03ab8b/da1816d6e68348d5be856ed432abfcfc/FLAG80ac660a5 [2019-01-14 16:50:44,967 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c03ab8b/da1816d6e68348d5be856ed432abfcfc [2019-01-14 16:50:44,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 16:50:44,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 16:50:44,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 16:50:44,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 16:50:44,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 16:50:44,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:50:44" (1/1) ... [2019-01-14 16:50:44,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453f9d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:44, skipping insertion in model container [2019-01-14 16:50:44,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:50:44" (1/1) ... [2019-01-14 16:50:44,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 16:50:45,045 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 16:50:45,429 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:50:45,446 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 16:50:45,590 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:50:45,655 INFO L195 MainTranslator]: Completed translation [2019-01-14 16:50:45,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45 WrapperNode [2019-01-14 16:50:45,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 16:50:45,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 16:50:45,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 16:50:45,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 16:50:45,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 16:50:45,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 16:50:45,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 16:50:45,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 16:50:45,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (1/1) ... [2019-01-14 16:50:45,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 16:50:45,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 16:50:45,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 16:50:45,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 16:50:45,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50: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-14 16:50:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 16:50:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 16:50:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 16:50:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 16:50:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 16:50:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 16:50:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 16:50:46,260 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 16:50:46,261 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 16:50:46,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:50:46 BoogieIcfgContainer [2019-01-14 16:50:46,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 16:50:46,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 16:50:46,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 16:50:46,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 16:50:46,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 04:50:44" (1/3) ... [2019-01-14 16:50:46,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f264d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:50:46, skipping insertion in model container [2019-01-14 16:50:46,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:50:45" (2/3) ... [2019-01-14 16:50:46,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f264d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:50:46, skipping insertion in model container [2019-01-14 16:50:46,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:50:46" (3/3) ... [2019-01-14 16:50:46,271 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2019-01-14 16:50:46,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 16:50:46,287 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 16:50:46,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 16:50:46,335 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 16:50:46,335 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 16:50:46,336 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 16:50:46,336 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 16:50:46,336 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 16:50:46,336 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 16:50:46,336 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 16:50:46,336 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 16:50:46,337 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 16:50:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-14 16:50:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 16:50:46,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:46,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:46,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash 561717608, now seen corresponding path program 1 times [2019-01-14 16:50:46,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:46,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:46,511 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-14 16:50:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:50:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 16:50:46,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 16:50:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 16:50:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 16:50:46,532 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-14 16:50:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:46,545 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-14 16:50:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 16:50:46,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 16:50:46,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:46,557 INFO L225 Difference]: With dead ends: 29 [2019-01-14 16:50:46,557 INFO L226 Difference]: Without dead ends: 14 [2019-01-14 16:50:46,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 16:50:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-14 16:50:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-14 16:50:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 16:50:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-14 16:50:46,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2019-01-14 16:50:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:46,597 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-14 16:50:46,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 16:50:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-01-14 16:50:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 16:50:46,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:46,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:46,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:46,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash -861307399, now seen corresponding path program 1 times [2019-01-14 16:50:46,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:46,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:46,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:46,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:46,807 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-14 16:50:46,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:50:46,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 16:50:46,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 16:50:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 16:50:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:50:46,811 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2019-01-14 16:50:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:47,041 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-01-14 16:50:47,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 16:50:47,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 16:50:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:47,042 INFO L225 Difference]: With dead ends: 26 [2019-01-14 16:50:47,042 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 16:50:47,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 16:50:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 16:50:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 16:50:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 16:50:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-01-14 16:50:47,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-01-14 16:50:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:47,049 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-14 16:50:47,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 16:50:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-01-14 16:50:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 16:50:47,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:47,050 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:47,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 909226845, now seen corresponding path program 1 times [2019-01-14 16:50:47,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:47,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:47,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:47,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:47,313 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-14 16:50:47,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:47,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:47,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:47,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 16:50:47,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 16:50:47,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:47,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:47,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:47,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:47,644 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 43 treesize of output 36 [2019-01-14 16:50:47,650 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-14 16:50:47,650 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:47,777 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-14 16:50:47,798 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 24 treesize of output 27 [2019-01-14 16:50:47,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:47,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2019-01-14 16:50:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:47,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:47,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:47,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2019-01-14 16:50:47,930 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:47,949 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:47,958 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,030 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-14 16:50:48,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:48,049 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2019-01-14 16:50:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:48,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 16:50:48,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-14 16:50:48,256 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 19 treesize of output 22 [2019-01-14 16:50:48,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:48,276 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 22 treesize of output 14 [2019-01-14 16:50:48,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:48,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:48,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2019-01-14 16:50:48,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:48,767 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-14 16:50:48,767 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:48,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 57 [2019-01-14 16:50:48,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 13 [2019-01-14 16:50:48,860 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-14 16:50:48,924 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 16:50:48,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 16:50:49,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 16:50:49,010 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:94, output treesize:27 [2019-01-14 16:50:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:50:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 16:50:49,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 16:50:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 16:50:49,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 16:50:49,076 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 7 states. [2019-01-14 16:50:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:50:49,338 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-01-14 16:50:49,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 16:50:49,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 16:50:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:50:49,342 INFO L225 Difference]: With dead ends: 38 [2019-01-14 16:50:49,342 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 16:50:49,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 16:50:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 16:50:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2019-01-14 16:50:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 16:50:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-14 16:50:49,349 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2019-01-14 16:50:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:50:49,350 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-14 16:50:49,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 16:50:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-14 16:50:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 16:50:49,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:50:49,351 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:50:49,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:50:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:50:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1525342480, now seen corresponding path program 1 times [2019-01-14 16:50:49,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:50:49,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:50:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:50:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:49,685 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-01-14 16:50:49,822 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-14 16:50:49,958 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-01-14 16:50:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:50:50,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:50:50,158 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-14 16:50:50,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:50:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:50:50,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:50:50,337 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 16:50:50,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-14 16:50:50,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:50,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:50,387 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 43 treesize of output 36 [2019-01-14 16:50:50,391 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-14 16:50:50,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,409 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-14 16:50:50,413 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 24 treesize of output 27 [2019-01-14 16:50:50,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:50,421 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2019-01-14 16:50:50,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:50,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:50,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:50:50,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2019-01-14 16:50:50,443 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,462 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,472 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:50,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:50,494 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:66, output treesize:19 [2019-01-14 16:50:50,620 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 77 treesize of output 71 [2019-01-14 16:50:50,638 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2019-01-14 16:50:50,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:50,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:50,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 73 treesize of output 131 [2019-01-14 16:50:50,756 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 16:50:50,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 110 [2019-01-14 16:50:50,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2019-01-14 16:50:52,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 80 [2019-01-14 16:50:52,189 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-01-14 16:50:52,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 80 [2019-01-14 16:50:52,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-14 16:50:53,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 78 treesize of output 73 [2019-01-14 16:50:53,883 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:54,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 80 [2019-01-14 16:50:54,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 16:50:54,844 INFO L303 Elim1Store]: Index analysis took 173 ms [2019-01-14 16:50:54,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 96 [2019-01-14 16:50:54,884 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2019-01-14 16:50:56,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 19 xjuncts. [2019-01-14 16:50:56,442 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 54 treesize of output 48 [2019-01-14 16:50:56,446 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 32 treesize of output 17 [2019-01-14 16:50:56,446 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,460 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 58 treesize of output 50 [2019-01-14 16:50:56,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-01-14 16:50:56,465 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,486 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,495 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 57 treesize of output 49 [2019-01-14 16:50:56,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 38 treesize of output 19 [2019-01-14 16:50:56,503 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,513 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,516 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 51 treesize of output 45 [2019-01-14 16:50:56,521 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 30 treesize of output 15 [2019-01-14 16:50:56,521 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,533 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,536 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 52 treesize of output 46 [2019-01-14 16:50:56,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-14 16:50:56,547 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,558 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,561 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 54 treesize of output 48 [2019-01-14 16:50:56,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 16 [2019-01-14 16:50:56,565 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,577 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,580 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 73 treesize of output 67 [2019-01-14 16:50:56,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 25 [2019-01-14 16:50:56,588 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,598 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,617 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 73 treesize of output 67 [2019-01-14 16:50:56,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 25 [2019-01-14 16:50:56,634 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,658 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,661 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 51 treesize of output 45 [2019-01-14 16:50:56,664 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 30 treesize of output 15 [2019-01-14 16:50:56,665 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,674 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,676 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 55 treesize of output 49 [2019-01-14 16:50:56,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-14 16:50:56,683 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,710 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,713 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 45 treesize of output 39 [2019-01-14 16:50:56,718 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 26 treesize of output 11 [2019-01-14 16:50:56,718 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,730 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,733 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 57 treesize of output 49 [2019-01-14 16:50:56,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 38 treesize of output 19 [2019-01-14 16:50:56,739 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,746 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,753 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 46 treesize of output 42 [2019-01-14 16:50:56,772 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 25 treesize of output 13 [2019-01-14 16:50:56,773 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,842 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,845 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 43 treesize of output 37 [2019-01-14 16:50:56,848 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 30 treesize of output 15 [2019-01-14 16:50:56,849 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,858 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,861 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 74 treesize of output 68 [2019-01-14 16:50:56,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-01-14 16:50:56,866 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,879 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:50:56,882 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 69 treesize of output 59 [2019-01-14 16:50:56,889 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 45 treesize of output 22 [2019-01-14 16:50:56,889 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,907 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,910 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 72 treesize of output 66 [2019-01-14 16:50:56,916 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 39 treesize of output 24 [2019-01-14 16:50:56,917 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,927 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,932 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 50 treesize of output 44 [2019-01-14 16:50:56,935 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 32 treesize of output 17 [2019-01-14 16:50:56,936 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,943 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,946 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 72 treesize of output 66 [2019-01-14 16:50:56,951 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 39 treesize of output 24 [2019-01-14 16:50:56,951 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-14 16:50:56,962 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:50:57,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 63 dim-0 vars, and 16 xjuncts. [2019-01-14 16:50:57,333 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 7 variables, input treesize:95, output treesize:609 [2019-01-14 16:50:59,566 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 76 [2019-01-14 16:50:59,903 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 16:51:00,172 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-01-14 16:51:00,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-14 16:51:00,198 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 23 treesize of output 11 [2019-01-14 16:51:00,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,215 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 5 treesize of output 1 [2019-01-14 16:51:00,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2019-01-14 16:51:00,266 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 44 treesize of output 37 [2019-01-14 16:51:00,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,312 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 36 treesize of output 29 [2019-01-14 16:51:00,313 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:51:00,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:51:00,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-01-14 16:51:00,353 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,393 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 33 treesize of output 24 [2019-01-14 16:51:00,394 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,418 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 24 treesize of output 19 [2019-01-14 16:51:00,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 16:51:00,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:00,571 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:97, output treesize:7 [2019-01-14 16:51:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:51:00,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:51:00,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-14 16:51:00,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 16:51:00,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 16:51:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2019-01-14 16:51:00,613 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 14 states. [2019-01-14 16:51:00,854 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-14 16:51:01,621 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-01-14 16:51:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:51:01,839 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-01-14 16:51:01,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 16:51:01,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-14 16:51:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:51:01,842 INFO L225 Difference]: With dead ends: 44 [2019-01-14 16:51:01,842 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 16:51:01,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=130, Invalid=421, Unknown=1, NotChecked=0, Total=552 [2019-01-14 16:51:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 16:51:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-01-14 16:51:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 16:51:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-14 16:51:01,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2019-01-14 16:51:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:51:01,849 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 16:51:01,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 16:51:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-14 16:51:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 16:51:01,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:51:01,850 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:51:01,850 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:51:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:51:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1328429964, now seen corresponding path program 1 times [2019-01-14 16:51:01,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:51:01,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:51:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:51:01,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:51:01,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:51:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:51:02,120 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-01-14 16:51:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:51:02,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:51:02,367 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-14 16:51:02,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:51:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:51:02,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:51:02,521 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 77 treesize of output 71 [2019-01-14 16:51:02,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2019-01-14 16:51:02,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:02,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:02,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 93 [2019-01-14 16:51:02,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 56 [2019-01-14 16:51:02,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:02,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 63 [2019-01-14 16:51:02,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 16:51:02,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 76 [2019-01-14 16:51:02,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-14 16:51:03,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 92 [2019-01-14 16:51:03,272 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 9 xjuncts. [2019-01-14 16:51:03,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 12 xjuncts. [2019-01-14 16:51:03,820 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 35 treesize of output 31 [2019-01-14 16:51:03,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 12 [2019-01-14 16:51:03,825 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:03,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:03,835 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 38 treesize of output 34 [2019-01-14 16:51:03,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 14 [2019-01-14 16:51:03,844 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:03,888 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:03,891 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 55 treesize of output 47 [2019-01-14 16:51:03,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 44 treesize of output 25 [2019-01-14 16:51:03,895 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,903 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,906 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 50 treesize of output 42 [2019-01-14 16:51:03,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 38 treesize of output 19 [2019-01-14 16:51:03,913 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,923 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,925 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 45 treesize of output 39 [2019-01-14 16:51:03,928 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 28 treesize of output 13 [2019-01-14 16:51:03,929 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,941 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,943 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 58 treesize of output 50 [2019-01-14 16:51:03,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 27 [2019-01-14 16:51:03,947 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:03,964 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:03,967 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 44 treesize of output 38 [2019-01-14 16:51:03,970 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 30 treesize of output 15 [2019-01-14 16:51:03,971 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,981 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,983 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 62 treesize of output 52 [2019-01-14 16:51:03,986 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 49 treesize of output 26 [2019-01-14 16:51:03,987 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:03,999 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,001 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 64 treesize of output 54 [2019-01-14 16:51:04,005 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 47 treesize of output 24 [2019-01-14 16:51:04,005 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,019 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,022 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 41 treesize of output 35 [2019-01-14 16:51:04,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-14 16:51:04,036 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:04,055 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:51:04,057 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 56 treesize of output 52 [2019-01-14 16:51:04,060 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 32 treesize of output 20 [2019-01-14 16:51:04,060 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,071 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,074 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 47 treesize of output 41 [2019-01-14 16:51:04,078 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 32 treesize of output 17 [2019-01-14 16:51:04,079 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,089 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:04,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 21 dim-0 vars, and 11 xjuncts. [2019-01-14 16:51:04,252 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 5 variables, input treesize:84, output treesize:273 [2019-01-14 16:51:08,377 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 123 DAG size of output: 7 [2019-01-14 16:51:08,412 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 22 treesize of output 16 [2019-01-14 16:51:08,415 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 16 treesize of output 7 [2019-01-14 16:51:08,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:51:08,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:51:08,422 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-14 16:51:08,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-01-14 16:51:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 16:51:08,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:51:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-01-14 16:51:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 16:51:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 16:51:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-01-14 16:51:08,460 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 15 states. [2019-01-14 16:51:09,150 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-14 16:51:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:51:09,352 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-01-14 16:51:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 16:51:09,352 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-01-14 16:51:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:51:09,354 INFO L225 Difference]: With dead ends: 46 [2019-01-14 16:51:09,354 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 16:51:09,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-01-14 16:51:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 16:51:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 16:51:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 16:51:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 16:51:09,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-14 16:51:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:51:09,356 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 16:51:09,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 16:51:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 16:51:09,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 16:51:09,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 16:51:09,689 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-01-14 16:51:09,699 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 16:51:09,699 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 590) no Hoare annotation was computed. [2019-01-14 16:51:09,700 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2019-01-14 16:51:09,700 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2019-01-14 16:51:09,700 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 16:51:09,700 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-01-14 16:51:09,700 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 16:51:09,700 INFO L444 ceAbstractionStarter]: At program point L575-2(lines 573 582) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_main_~m~0.base) ULTIMATE.start_main_~m~0.offset)) (.cse4 (+ ULTIMATE.start_main_~list~0.offset 4))) (let ((.cse0 (= ULTIMATE.start_main_~m~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~list~0.base) .cse4))) (.cse1 (= |ULTIMATE.start_main_#t~mem7| .cse2))) (and (or .cse0 .cse1) (not (= ULTIMATE.start_main_~m~0.base ULTIMATE.start_main_~head~0.base)) (= (select |#valid| ULTIMATE.start_main_~m~0.base) 1) (= ULTIMATE.start_main_~list~0.base ULTIMATE.start_main_~head~0.base) (= 0 .cse2) (or (not .cse0) (let ((.cse3 (= ULTIMATE.start_main_~m~0.offset (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~list~0.base) .cse4)))) (and (or (not .cse3) (= (select (select |#memory_int| ULTIMATE.start_main_~list~0.base) ULTIMATE.start_main_~list~0.offset) 1)) (or .cse3 .cse1)))) (= (select |#valid| ULTIMATE.start_main_~head~0.base) 1) (= 1 (select (select |#memory_int| ULTIMATE.start_main_~head~0.base) ULTIMATE.start_main_~head~0.offset)) (not (= ULTIMATE.start_main_~head~0.offset (+ ULTIMATE.start_main_~list~0.offset 8)))))) [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 590) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 591) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point L584-1(lines 584 588) no Hoare annotation was computed. [2019-01-14 16:51:09,701 INFO L444 ceAbstractionStarter]: At program point L584-3(lines 584 588) the Hoare annotation is: (<= (select (select |#memory_int| ULTIMATE.start_main_~m~0.base) ULTIMATE.start_main_~m~0.offset) 100) [2019-01-14 16:51:09,701 INFO L448 ceAbstractionStarter]: For program point L584-4(lines 584 588) no Hoare annotation was computed. [2019-01-14 16:51:09,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,712 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,713 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,713 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,716 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,718 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,721 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,722 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,722 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,722 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,724 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,726 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 04:51:09 BoogieIcfgContainer [2019-01-14 16:51:09,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 16:51:09,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 16:51:09,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 16:51:09,734 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 16:51:09,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:50:46" (3/4) ... [2019-01-14 16:51:09,741 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 16:51:09,751 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 16:51:09,751 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 16:51:09,751 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 16:51:09,803 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 16:51:09,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 16:51:09,805 INFO L168 Benchmark]: Toolchain (without parser) took 24834.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -77.8 MB). Peak memory consumption was 230.0 MB. Max. memory is 11.5 GB. [2019-01-14 16:51:09,805 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-14 16:51:09,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 16:51:09,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:51:09,809 INFO L168 Benchmark]: Boogie Preprocessor took 31.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:51:09,809 INFO L168 Benchmark]: RCFGBuilder took 524.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-14 16:51:09,809 INFO L168 Benchmark]: TraceAbstraction took 23470.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. [2019-01-14 16:51:09,810 INFO L168 Benchmark]: Witness Printer took 70.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 16:51:09,815 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 685.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 524.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23470.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. * Witness Printer took 70.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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_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_int - 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_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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 590]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 573]: Loop Invariant [2019-01-14 16:51:09,823 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,824 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,824 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,824 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,832 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,834 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:51:09,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:51:09,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:51:09,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((m == #memory_$Pointer$[list][list + 4] || aux-m->val-aux == unknown-#memory_int-unknown[m][m]) && !(m == head)) && \valid[m] == 1) && list == head) && 0 == unknown-#memory_int-unknown[m][m]) && (!(m == #memory_$Pointer$[list][list + 4]) || ((!(m == #memory_$Pointer$[list][list + 4]) || unknown-#memory_int-unknown[list][list] == 1) && (m == #memory_$Pointer$[list][list + 4] || aux-m->val-aux == unknown-#memory_int-unknown[m][m])))) && \valid[head] == 1) && 1 == unknown-#memory_int-unknown[head][head]) && !(head == list + 8) - InvariantResult [Line: 584]: Loop Invariant [2019-01-14 16:51:09,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 16:51:09,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: unknown-#memory_int-unknown[m][m] <= 100 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 23.3s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 76 SDslu, 209 SDs, 0 SdLazy, 287 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 110 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1767 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 228 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 98 ConstructedInterpolants, 13 QuantifiedInterpolants, 24270 SizeOfPredicates, 28 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 3/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...