./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-12 10:35:14,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:35:14,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:35:14,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:35:14,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:35:14,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:35:14,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:35:14,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:35:14,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:35:14,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:35:14,871 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:35:14,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:35:14,875 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:35:14,876 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:35:14,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:35:14,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:35:14,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:35:14,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:35:14,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:35:14,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:35:14,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:35:14,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:35:14,893 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:35:14,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:35:14,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:35:14,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:35:14,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:35:14,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:35:14,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:35:14,898 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:35:14,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:35:14,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:35:14,899 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:35:14,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:35:14,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:35:14,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:35:14,902 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:35:14,916 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:35:14,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:35:14,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:35:14,918 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:35:14,918 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:35:14,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:35:14,919 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:35:14,919 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:35:14,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:35:14,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:35:14,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:35:14,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:35:14,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:35:14,920 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:35:14,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:35:14,922 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:35:14,922 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:35:14,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:35:14,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:35:14,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:35:14,923 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:35:14,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:35:14,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:35:14,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:35:14,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:35:14,924 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:35:14,925 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:35:14,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:35:14,925 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-12 10:35:14,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:35:14,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:35:14,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:35:14,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:35:14,982 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:35:14,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-data/shared_mem2_true-unreach-call.i [2019-01-12 10:35:15,051 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5525f5e77/6b366564a46942549d3d3cb3ce7764c2/FLAG3da880132 [2019-01-12 10:35:15,532 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:35:15,532 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-data/shared_mem2_true-unreach-call.i [2019-01-12 10:35:15,560 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5525f5e77/6b366564a46942549d3d3cb3ce7764c2/FLAG3da880132 [2019-01-12 10:35:15,840 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5525f5e77/6b366564a46942549d3d3cb3ce7764c2 [2019-01-12 10:35:15,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:35:15,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:35:15,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:35:15,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:35:15,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:35:15,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:35:15" (1/1) ... [2019-01-12 10:35:15,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a077fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:15, skipping insertion in model container [2019-01-12 10:35:15,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:35:15" (1/1) ... [2019-01-12 10:35:15,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:35:15,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:35:16,306 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:35:16,318 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:35:16,455 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:35:16,509 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:35:16,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16 WrapperNode [2019-01-12 10:35:16,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:35:16,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:35:16,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:35:16,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:35:16,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:35:16,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:35:16,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:35:16,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:35:16,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... [2019-01-12 10:35:16,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:35:16,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:35:16,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:35:16,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:35:16,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:35:16,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 10:35:16,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 10:35:16,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 10:35:16,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 10:35:16,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 10:35:16,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:35:16,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:35:17,178 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:35:17,179 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-12 10:35:17,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:17 BoogieIcfgContainer [2019-01-12 10:35:17,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:35:17,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:35:17,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:35:17,184 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:35:17,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:35:15" (1/3) ... [2019-01-12 10:35:17,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405b51c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:35:17, skipping insertion in model container [2019-01-12 10:35:17,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:35:16" (2/3) ... [2019-01-12 10:35:17,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405b51c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:35:17, skipping insertion in model container [2019-01-12 10:35:17,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:17" (3/3) ... [2019-01-12 10:35:17,188 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2019-01-12 10:35:17,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:35:17,206 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:35:17,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:35:17,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:35:17,247 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:35:17,247 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:35:17,247 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:35:17,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:35:17,248 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:35:17,248 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:35:17,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:35:17,248 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:35:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-12 10:35:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 10:35:17,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:17,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:17,272 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash 561717608, now seen corresponding path program 1 times [2019-01-12 10:35:17,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:17,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:17,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:17,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:17,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:17,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 10:35:17,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 10:35:17,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 10:35:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 10:35:17,456 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-12 10:35:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:17,470 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-12 10:35:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 10:35:17,471 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-12 10:35:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:17,481 INFO L225 Difference]: With dead ends: 29 [2019-01-12 10:35:17,481 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 10:35:17,485 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-12 10:35:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 10:35:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 10:35:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 10:35:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-01-12 10:35:17,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2019-01-12 10:35:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:17,518 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-01-12 10:35:17,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 10:35:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-01-12 10:35:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 10:35:17,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:17,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:17,519 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash -861307399, now seen corresponding path program 1 times [2019-01-12 10:35:17,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:17,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:35:17,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:35:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 10:35:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 10:35:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 10:35:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:35:17,750 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2019-01-12 10:35:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:17,941 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-01-12 10:35:17,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:35:17,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 10:35:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:17,943 INFO L225 Difference]: With dead ends: 26 [2019-01-12 10:35:17,943 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 10:35:17,944 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-12 10:35:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 10:35:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 10:35:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:35:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-01-12 10:35:17,949 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-01-12 10:35:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:17,949 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-12 10:35:17,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 10:35:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-01-12 10:35:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 10:35:17,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:17,950 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:17,951 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:17,951 INFO L82 PathProgramCache]: Analyzing trace with hash 909226845, now seen corresponding path program 1 times [2019-01-12 10:35:17,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:17,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:18,153 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-12 10:35:18,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:18,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:35:18,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:18,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:18,401 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-12 10:35:18,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:18,427 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-12 10:35:18,439 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-12 10:35:18,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:18,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:18,652 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-12 10:35:18,687 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-12 10:35:18,723 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-12 10:35:18,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 10:35:18,728 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:18,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-12 10:35:18,768 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-12 10:35:18,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:18,792 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-12 10:35:18,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:18,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:18,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:18,905 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-12 10:35:18,906 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-12 10:35:18,908 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:18,925 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:18,933 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:18,971 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,035 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-12 10:35:19,036 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2019-01-12 10:35:19,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:19,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:19,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:19,128 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-12 10:35:19,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,227 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-12 10:35:19,239 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-12 10:35:19,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:19,248 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-12 10:35:19,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,548 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-12 10:35:19,555 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-12 10:35:19,621 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-12 10:35:19,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:19,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 10:35:19,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:19,681 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-12 10:35:19,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 10:35:19,705 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-12 10:35:19,798 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:35:20,011 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-12 10:35:20,148 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-12 10:35:20,148 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:94, output treesize:27 [2019-01-12 10:35:20,192 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-12 10:35:20,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:35:20,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-12 10:35:20,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 10:35:20,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 10:35:20,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 10:35:20,215 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 7 states. [2019-01-12 10:35:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:20,505 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-01-12 10:35:20,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 10:35:20,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-12 10:35:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:20,509 INFO L225 Difference]: With dead ends: 38 [2019-01-12 10:35:20,509 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 10:35:20,510 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-12 10:35:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 10:35:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2019-01-12 10:35:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 10:35:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-12 10:35:20,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2019-01-12 10:35:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:20,516 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-12 10:35:20,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 10:35:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-12 10:35:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 10:35:20,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:20,517 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:20,517 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1525342480, now seen corresponding path program 1 times [2019-01-12 10:35:20,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:20,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:20,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:20,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:20,834 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-01-12 10:35:21,013 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-01-12 10:35:21,147 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-01-12 10:35:21,468 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-12 10:35:21,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:21,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:35:21,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:21,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:21,579 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-12 10:35:21,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:21,598 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-12 10:35:21,604 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-12 10:35:21,619 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-12 10:35:21,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 10:35:21,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:21,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-12 10:35:21,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-12 10:35:21,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:21,656 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-12 10:35:21,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:21,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:21,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:21,681 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-12 10:35:21,682 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:21,692 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:21,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:21,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:21,718 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-12 10:35:21,730 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-12 10:35:21,731 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:66, output treesize:19 [2019-01-12 10:35:21,875 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-12 10:35:21,888 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-12 10:35:21,889 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-12 10:35:21,898 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-12 10:35:22,016 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-12 10:35:22,017 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-12 10:35:22,172 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-12 10:35:22,180 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-12 10:35:23,475 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-12 10:35:23,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2019-01-12 10:35:24,182 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-12 10:35:24,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-12 10:35:25,108 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-12 10:35:25,110 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:25,511 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-12 10:35:25,516 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-12 10:35:26,149 INFO L303 Elim1Store]: Index analysis took 244 ms [2019-01-12 10:35:26,188 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-12 10:35:26,200 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-12 10:35:27,344 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-12 10:35:27,774 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-12 10:35:27,778 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-12 10:35:27,778 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,788 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,791 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-12 10:35:27,799 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-12 10:35:27,800 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-12 10:35:27,813 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-12 10:35:27,833 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-12 10:35:27,845 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-12 10:35:27,845 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,875 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,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 51 treesize of output 45 [2019-01-12 10:35:27,887 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-12 10:35:27,887 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,899 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,902 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-12 10:35:27,906 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-12 10:35:27,907 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-12 10:35:27,922 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-12 10:35:27,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 54 treesize of output 48 [2019-01-12 10:35:27,930 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-12 10:35:27,931 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,945 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,960 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-12 10:35:27,965 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-12 10:35:27,966 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,977 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,981 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-12 10:35:27,985 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-12 10:35:27,986 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,995 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:27,998 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-12 10:35:28,006 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-12 10:35:28,006 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,017 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,020 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-12 10:35:28,025 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-12 10:35:28,026 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-12 10:35:28,041 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-12 10:35:28,044 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-12 10:35:28,047 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-12 10:35:28,047 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,056 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,059 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-12 10:35:28,064 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-12 10:35:28,064 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,074 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,077 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-12 10:35:28,080 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-12 10:35:28,081 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,092 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,096 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-12 10:35:28,099 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-12 10:35:28,100 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,106 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,111 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-12 10:35:28,123 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-12 10:35:28,124 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-12 10:35:28,142 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-12 10:35:28,162 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-12 10:35:28,174 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-12 10:35:28,174 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,253 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,256 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-12 10:35:28,262 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-12 10:35:28,263 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,277 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,281 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-12 10:35:28,285 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-12 10:35:28,285 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,293 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,296 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-12 10:35:28,300 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-12 10:35:28,301 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,310 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:28,680 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-12 10:35:28,680 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 7 variables, input treesize:95, output treesize:609 [2019-01-12 10:35:30,955 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 76 [2019-01-12 10:35:31,354 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-12 10:35:31,570 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-12 10:35:31,574 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-12 10:35:31,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,591 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-12 10:35:31,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,643 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-12 10:35:31,648 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-12 10:35:31,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,686 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-12 10:35:31,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:31,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:35:31,725 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-12 10:35:31,725 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,755 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-12 10:35:31,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,784 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-12 10:35:31,785 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:31,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:35:31,933 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-12 10:35:31,933 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:97, output treesize:7 [2019-01-12 10:35:31,955 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-12 10:35:31,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:35:31,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-12 10:35:31,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 10:35:31,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 10:35:31,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2019-01-12 10:35:31,979 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 14 states. [2019-01-12 10:35:32,230 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-12 10:35:32,993 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-01-12 10:35:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:33,227 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-01-12 10:35:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 10:35:33,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-12 10:35:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:33,230 INFO L225 Difference]: With dead ends: 44 [2019-01-12 10:35:33,230 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 10:35:33,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=130, Invalid=421, Unknown=1, NotChecked=0, Total=552 [2019-01-12 10:35:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 10:35:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-01-12 10:35:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 10:35:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 10:35:33,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2019-01-12 10:35:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:33,239 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 10:35:33,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 10:35:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 10:35:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:35:33,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:35:33,240 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:35:33,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:35:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:35:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1328429964, now seen corresponding path program 1 times [2019-01-12 10:35:33,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:35:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:35:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:35:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:33,541 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-01-12 10:35:33,799 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-01-12 10:35:33,849 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-12 10:35:33,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:35:33,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 10:35:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:35:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:35:33,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:35:34,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 77 treesize of output 71 [2019-01-12 10:35:34,004 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-12 10:35:34,005 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-12 10:35:34,014 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-12 10:35:34,071 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-12 10:35:34,083 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-12 10:35:34,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:34,259 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-12 10:35:34,263 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-12 10:35:34,485 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-12 10:35:34,487 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-12 10:35:34,951 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-12 10:35:34,958 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-12 10:35:35,191 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-12 10:35:35,544 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-12 10:35:35,559 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-12 10:35:35,559 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-12 10:35:35,618 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-12 10:35:35,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 38 treesize of output 34 [2019-01-12 10:35:35,624 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-12 10:35:35,625 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-12 10:35:35,667 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-12 10:35:35,672 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-12 10:35:35,678 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-12 10:35:35,678 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,687 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,690 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-12 10:35:35,696 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-12 10:35:35,696 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,703 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,706 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-12 10:35:35,709 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-12 10:35:35,709 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,721 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,723 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-12 10:35:35,726 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-12 10:35:35,729 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-12 10:35:35,740 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-12 10:35:35,743 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-12 10:35:35,745 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-12 10:35:35,745 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,757 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2019-01-12 10:35:35,764 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-12 10:35:35,764 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,775 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,778 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-12 10:35:35,784 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-12 10:35:35,785 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,794 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,797 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-12 10:35:35,801 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-12 10:35:35,802 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-12 10:35:35,813 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-12 10:35:35,816 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-12 10:35:35,819 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-12 10:35:35,819 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,828 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,830 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-12 10:35:35,836 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-12 10:35:35,837 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:35,853 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:36,018 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-12 10:35:36,019 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 5 variables, input treesize:84, output treesize:273 [2019-01-12 10:35:40,141 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 123 DAG size of output: 7 [2019-01-12 10:35:40,175 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-12 10:35:40,178 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-12 10:35:40,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:35:40,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:40,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:35:40,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-01-12 10:35:40,202 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-12 10:35:40,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:35:40,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-01-12 10:35:40,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 10:35:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 10:35:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-01-12 10:35:40,224 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 15 states. [2019-01-12 10:35:40,715 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-12 10:35:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:35:40,928 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-01-12 10:35:40,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 10:35:40,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-01-12 10:35:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:35:40,929 INFO L225 Difference]: With dead ends: 46 [2019-01-12 10:35:40,929 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 10:35:40,930 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-12 10:35:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 10:35:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 10:35:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 10:35:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 10:35:40,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-12 10:35:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:35:40,931 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 10:35:40,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 10:35:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 10:35:40,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 10:35:40,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 10:35:41,179 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-01-12 10:35:41,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 10:35:41,191 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 590) no Hoare annotation was computed. [2019-01-12 10:35:41,191 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2019-01-12 10:35:41,191 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2019-01-12 10:35:41,191 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 10:35:41,191 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-01-12 10:35:41,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 10:35:41,192 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-12 10:35:41,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 10:35:41,192 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2019-01-12 10:35:41,192 INFO L448 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2019-01-12 10:35:41,192 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 591) no Hoare annotation was computed. [2019-01-12 10:35:41,192 INFO L448 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2019-01-12 10:35:41,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 590) no Hoare annotation was computed. [2019-01-12 10:35:41,193 INFO L448 ceAbstractionStarter]: For program point L584-1(lines 584 588) no Hoare annotation was computed. [2019-01-12 10:35:41,193 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-12 10:35:41,193 INFO L448 ceAbstractionStarter]: For program point L584-4(lines 584 588) no Hoare annotation was computed. [2019-01-12 10:35:41,201 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,202 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,202 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,203 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,208 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,212 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,214 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,214 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,215 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:35:41 BoogieIcfgContainer [2019-01-12 10:35:41,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:35:41,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:35:41,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:35:41,224 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:35:41,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:35:17" (3/4) ... [2019-01-12 10:35:41,229 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 10:35:41,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 10:35:41,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 10:35:41,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 10:35:41,299 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:35:41,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:35:41,301 INFO L168 Benchmark]: Toolchain (without parser) took 25454.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 952.7 MB in the beginning and 974.3 MB in the end (delta: -21.5 MB). Peak memory consumption was 286.2 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:41,302 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:35:41,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:41,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.20 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-12 10:35:41,303 INFO L168 Benchmark]: Boogie Preprocessor took 47.07 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-12 10:35:41,303 INFO L168 Benchmark]: RCFGBuilder took 566.39 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: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:41,303 INFO L168 Benchmark]: TraceAbstraction took 24041.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 974.3 MB in the end (delta: 118.3 MB). Peak memory consumption was 288.1 MB. Max. memory is 11.5 GB. [2019-01-12 10:35:41,304 INFO L168 Benchmark]: Witness Printer took 77.62 ms. Allocated memory is still 1.3 GB. Free memory is still 974.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:35:41,307 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.17 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 661.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.20 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 47.07 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 566.39 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: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24041.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 974.3 MB in the end (delta: 118.3 MB). Peak memory consumption was 288.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.62 ms. Allocated memory is still 1.3 GB. Free memory is still 974.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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-12 10:35:41,313 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,316 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,317 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,317 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,320 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,320 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:35:41,321 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,321 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:35:41,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:35:41,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,325 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-12 10:35:41,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 10:35:41,326 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.9s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 76 SDslu, 209 SDs, 0 SdLazy, 287 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 10.3s 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, 20.5s 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...