./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 2e94e6aa 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-2e94e6a [2018-12-31 05:24:47,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:24:47,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:24:47,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:24:47,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:24:47,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:24:47,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:24:47,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:24:47,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:24:47,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:24:47,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:24:47,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:24:47,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:24:47,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:24:47,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:24:47,905 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:24:47,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:24:47,909 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:24:47,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:24:47,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:24:47,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:24:47,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:24:47,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:24:47,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:24:47,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:24:47,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:24:47,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:24:47,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:24:47,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:24:47,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:24:47,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:24:47,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:24:47,928 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:24:47,928 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:24:47,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:24:47,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:24:47,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:24:47,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:24:47,949 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:24:47,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:24:47,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:24:47,951 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:24:47,951 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:24:47,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:24:47,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:24:47,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:24:47,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:24:47,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:24:47,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:24:47,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:24:47,953 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:24:47,954 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:24:47,954 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:24:47,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:24:47,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:24:47,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:24:47,955 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:24:47,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:24:47,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:24:47,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:24:47,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:24:47,957 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:24:47,957 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:24:47,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:24:47,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:24:47,958 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 [2018-12-31 05:24:47,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:24:48,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:24:48,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:24:48,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:24:48,015 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:24:48,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-data/shared_mem2_true-unreach-call.i [2018-12-31 05:24:48,076 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd37ca02/33717e4aa47a4e1aa3df6ccf27e210d5/FLAG392723db1 [2018-12-31 05:24:48,622 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:24:48,623 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-data/shared_mem2_true-unreach-call.i [2018-12-31 05:24:48,640 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd37ca02/33717e4aa47a4e1aa3df6ccf27e210d5/FLAG392723db1 [2018-12-31 05:24:48,904 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd37ca02/33717e4aa47a4e1aa3df6ccf27e210d5 [2018-12-31 05:24:48,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:24:48,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:24:48,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:24:48,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:24:48,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:24:48,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:24:48" (1/1) ... [2018-12-31 05:24:48,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79cebd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:48, skipping insertion in model container [2018-12-31 05:24:48,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:24:48" (1/1) ... [2018-12-31 05:24:48,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:24:48,995 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:24:49,384 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:24:49,399 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:24:49,521 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:24:49,590 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:24:49,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49 WrapperNode [2018-12-31 05:24:49,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:24:49,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:24:49,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:24:49,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:24:49,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:24:49,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:24:49,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:24:49,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:24:49,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (1/1) ... [2018-12-31 05:24:49,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:24:49,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:24:49,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:24:49,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:24:49,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (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 [2018-12-31 05:24:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:24:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:24:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 05:24:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 05:24:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 05:24:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:24:49,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:24:50,286 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:24:50,287 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-31 05:24:50,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:24:50 BoogieIcfgContainer [2018-12-31 05:24:50,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:24:50,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:24:50,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:24:50,292 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:24:50,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:24:48" (1/3) ... [2018-12-31 05:24:50,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d0ad1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:24:50, skipping insertion in model container [2018-12-31 05:24:50,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:24:49" (2/3) ... [2018-12-31 05:24:50,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d0ad1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:24:50, skipping insertion in model container [2018-12-31 05:24:50,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:24:50" (3/3) ... [2018-12-31 05:24:50,296 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-12-31 05:24:50,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:24:50,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:24:50,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:24:50,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:24:50,365 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:24:50,365 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:24:50,366 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:24:50,366 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:24:50,366 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:24:50,366 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:24:50,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:24:50,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:24:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-31 05:24:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-31 05:24:50,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:24:50,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:24:50,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:24:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:24:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash 561717608, now seen corresponding path program 1 times [2018-12-31 05:24:50,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:24:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:24:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:24:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:24:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:24:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:24:50,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:24:50,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:24:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:24:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:24:50,578 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-31 05:24:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:24:50,592 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-31 05:24:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:24:50,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-31 05:24:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:24:50,605 INFO L225 Difference]: With dead ends: 29 [2018-12-31 05:24:50,605 INFO L226 Difference]: Without dead ends: 14 [2018-12-31 05:24:50,611 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 [2018-12-31 05:24:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-31 05:24:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-31 05:24:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-31 05:24:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-31 05:24:50,653 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2018-12-31 05:24:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:24:50,654 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-31 05:24:50,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:24:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2018-12-31 05:24:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 05:24:50,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:24:50,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:24:50,656 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:24:50,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:24:50,657 INFO L82 PathProgramCache]: Analyzing trace with hash -861307399, now seen corresponding path program 1 times [2018-12-31 05:24:50,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:24:50,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:24:50,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:24:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:24:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:24:51,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:24:51,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 05:24:51,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:24:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:24:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:24:51,086 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 5 states. [2018-12-31 05:24:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:24:51,301 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-12-31 05:24:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:24:51,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 05:24:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:24:51,303 INFO L225 Difference]: With dead ends: 26 [2018-12-31 05:24:51,303 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 05:24:51,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:24:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 05:24:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 05:24:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 05:24:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-12-31 05:24:51,310 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2018-12-31 05:24:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:24:51,310 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-31 05:24:51,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:24:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-12-31 05:24:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 05:24:51,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:24:51,311 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:24:51,312 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:24:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:24:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 909226845, now seen corresponding path program 1 times [2018-12-31 05:24:51,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:24:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:24:51,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:51,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:24:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:24:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:24:51,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:24:51,517 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 [2018-12-31 05:24:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:24:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:24:51,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:24:51,772 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-31 05:24:51,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:51,793 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 [2018-12-31 05:24:51,812 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 [2018-12-31 05:24:51,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:51,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:51,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:51,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:51,990 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 [2018-12-31 05:24:52,002 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 [2018-12-31 05:24:52,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,166 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 [2018-12-31 05:24:52,182 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 [2018-12-31 05:24:52,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,216 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 [2018-12-31 05:24:52,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,246 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 [2018-12-31 05:24:52,247 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,268 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,278 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,292 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,302 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,402 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. [2018-12-31 05:24:52,403 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2018-12-31 05:24:52,614 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-31 05:24:52,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,644 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 [2018-12-31 05:24:52,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,749 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 [2018-12-31 05:24:52,764 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 [2018-12-31 05:24:52,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:52,806 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 [2018-12-31 05:24:52,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:52,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:52,934 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:53,037 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 [2018-12-31 05:24:53,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:53,050 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 [2018-12-31 05:24:53,051 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:53,119 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 [2018-12-31 05:24:53,152 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 [2018-12-31 05:24:53,153 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-31 05:24:53,254 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:24:53,497 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:24:53,668 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. [2018-12-31 05:24:53,668 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:94, output treesize:27 [2018-12-31 05:24:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:24:53,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:24:53,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-31 05:24:53,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 05:24:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 05:24:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:24:53,738 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 7 states. [2018-12-31 05:24:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:24:54,031 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-12-31 05:24:54,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:24:54,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-31 05:24:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:24:54,034 INFO L225 Difference]: With dead ends: 38 [2018-12-31 05:24:54,035 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 05:24:54,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-31 05:24:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 05:24:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-12-31 05:24:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-31 05:24:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-12-31 05:24:54,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2018-12-31 05:24:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:24:54,042 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-12-31 05:24:54,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 05:24:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-12-31 05:24:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 05:24:54,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:24:54,043 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:24:54,043 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:24:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:24:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1525342480, now seen corresponding path program 1 times [2018-12-31 05:24:54,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:24:54,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:24:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:54,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:24:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:24:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:24:54,433 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2018-12-31 05:24:54,564 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-12-31 05:24:54,731 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2018-12-31 05:24:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:24:54,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:24:54,948 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 [2018-12-31 05:24:54,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:24:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:24:55,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:24:55,149 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-31 05:24:55,164 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 [2018-12-31 05:24:55,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:55,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:55,264 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 [2018-12-31 05:24:55,268 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 [2018-12-31 05:24:55,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,286 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 [2018-12-31 05:24:55,290 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 [2018-12-31 05:24:55,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:55,298 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 [2018-12-31 05:24:55,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:55,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:55,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:24:55,312 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 [2018-12-31 05:24:55,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,382 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,393 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:24:55,412 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. [2018-12-31 05:24:55,413 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:66, output treesize:19 [2018-12-31 05:24:55,549 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 [2018-12-31 05:24:55,561 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 [2018-12-31 05:24:55,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:55,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:24:55,689 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 [2018-12-31 05:24:55,690 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-31 05:24:55,815 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 [2018-12-31 05:24:55,823 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-12-31 05:24:57,212 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 [2018-12-31 05:24:57,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-12-31 05:24:57,893 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 [2018-12-31 05:24:57,895 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-31 05:24:58,829 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 [2018-12-31 05:24:58,830 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:24:59,231 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 [2018-12-31 05:24:59,235 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-31 05:24:59,706 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 [2018-12-31 05:24:59,714 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 9 xjuncts. [2018-12-31 05:25:00,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 19 xjuncts. [2018-12-31 05:25:01,542 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 [2018-12-31 05:25:01,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2018-12-31 05:25:01,547 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,556 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,559 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 [2018-12-31 05:25:01,565 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 [2018-12-31 05:25:01,566 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,585 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,596 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 [2018-12-31 05:25:01,606 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 [2018-12-31 05:25:01,607 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,618 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,621 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 [2018-12-31 05:25:01,626 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 [2018-12-31 05:25:01,627 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,642 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,645 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 [2018-12-31 05:25:01,649 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 [2018-12-31 05:25:01,650 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,666 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,669 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 [2018-12-31 05:25:01,673 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 [2018-12-31 05:25:01,674 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,683 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,687 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 [2018-12-31 05:25:01,692 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 [2018-12-31 05:25:01,693 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,705 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,708 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 [2018-12-31 05:25:01,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2018-12-31 05:25:01,718 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,728 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,731 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 [2018-12-31 05:25:01,739 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 [2018-12-31 05:25:01,739 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,750 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,754 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 [2018-12-31 05:25:01,759 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 [2018-12-31 05:25:01,760 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,774 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,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 45 treesize of output 39 [2018-12-31 05:25:01,783 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 [2018-12-31 05:25:01,783 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,794 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,798 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 [2018-12-31 05:25:01,804 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 [2018-12-31 05:25:01,807 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,819 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,822 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 [2018-12-31 05:25:01,830 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 [2018-12-31 05:25:01,830 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,841 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-31 05:25:01,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-12-31 05:25:01,848 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,863 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:01,866 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 [2018-12-31 05:25:01,877 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 [2018-12-31 05:25:01,878 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,892 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:01,921 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 [2018-12-31 05:25:01,934 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 [2018-12-31 05:25:01,934 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,011 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,031 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 [2018-12-31 05:25:02,044 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 [2018-12-31 05:25:02,044 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,062 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,068 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 [2018-12-31 05:25:02,071 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 [2018-12-31 05:25:02,071 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,080 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,084 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 [2018-12-31 05:25:02,088 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 [2018-12-31 05:25:02,088 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,098 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:02,461 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. [2018-12-31 05:25:02,462 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 7 variables, input treesize:95, output treesize:609 [2018-12-31 05:25:04,834 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 76 [2018-12-31 05:25:05,213 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-31 05:25:05,454 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 [2018-12-31 05:25:05,462 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 [2018-12-31 05:25:05,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,476 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 [2018-12-31 05:25:05,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,524 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 [2018-12-31 05:25:05,533 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 [2018-12-31 05:25:05,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,582 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 [2018-12-31 05:25:05,583 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:05,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:05,622 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 [2018-12-31 05:25:05,623 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,654 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 [2018-12-31 05:25:05,654 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2018-12-31 05:25:05,682 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,804 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:25:05,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:05,841 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:97, output treesize:7 [2018-12-31 05:25:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-31 05:25:05,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 05:25:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 05:25:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2018-12-31 05:25:05,885 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 14 states. [2018-12-31 05:25:06,145 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-12-31 05:25:06,903 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-12-31 05:25:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:07,128 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-12-31 05:25:07,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 05:25:07,130 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-31 05:25:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:07,132 INFO L225 Difference]: With dead ends: 44 [2018-12-31 05:25:07,132 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 05:25:07,133 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 [2018-12-31 05:25:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 05:25:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-12-31 05:25:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 05:25:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 05:25:07,142 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2018-12-31 05:25:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:07,143 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 05:25:07,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 05:25:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 05:25:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 05:25:07,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:07,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:07,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:07,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1328429964, now seen corresponding path program 1 times [2018-12-31 05:25:07,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:07,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:07,772 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-12-31 05:25:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:07,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:07,803 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 [2018-12-31 05:25:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:07,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:07,976 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 [2018-12-31 05:25:07,978 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 [2018-12-31 05:25:07,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:07,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:08,048 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 [2018-12-31 05:25:08,062 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 [2018-12-31 05:25:08,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:08,237 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 [2018-12-31 05:25:08,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-31 05:25:08,449 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 [2018-12-31 05:25:08,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-12-31 05:25:08,775 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 [2018-12-31 05:25:08,782 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 9 xjuncts. [2018-12-31 05:25:09,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 12 xjuncts. [2018-12-31 05:25:09,333 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 [2018-12-31 05:25:09,352 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 [2018-12-31 05:25:09,353 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,443 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,445 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 [2018-12-31 05:25:09,448 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 [2018-12-31 05:25:09,449 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,458 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,461 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 [2018-12-31 05:25:09,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2018-12-31 05:25:09,465 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,473 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,476 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 [2018-12-31 05:25:09,479 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 [2018-12-31 05:25:09,479 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,486 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,488 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 [2018-12-31 05:25:09,492 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 [2018-12-31 05:25:09,492 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,501 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,504 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 [2018-12-31 05:25:09,507 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 [2018-12-31 05:25:09,507 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,516 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,519 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 [2018-12-31 05:25:09,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2018-12-31 05:25:09,522 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,541 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,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 62 treesize of output 52 [2018-12-31 05:25:09,549 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 [2018-12-31 05:25:09,549 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,556 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,559 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 [2018-12-31 05:25:09,563 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 [2018-12-31 05:25:09,564 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,578 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,581 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 [2018-12-31 05:25:09,584 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 [2018-12-31 05:25:09,586 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,593 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:09,596 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 [2018-12-31 05:25:09,598 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 [2018-12-31 05:25:09,598 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,605 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,608 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 [2018-12-31 05:25:09,614 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 [2018-12-31 05:25:09,615 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,624 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:09,788 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. [2018-12-31 05:25:09,789 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 5 variables, input treesize:84, output treesize:273 [2018-12-31 05:25:13,895 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 123 DAG size of output: 7 [2018-12-31 05:25:13,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-31 05:25:13,961 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 [2018-12-31 05:25:13,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:14,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:14,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:14,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-12-31 05:25:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 05:25:14,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:14,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-12-31 05:25:14,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 05:25:14,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 05:25:14,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-31 05:25:14,155 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 15 states. [2018-12-31 05:25:14,299 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-12-31 05:25:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:14,871 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-12-31 05:25:14,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 05:25:14,872 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-12-31 05:25:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:14,872 INFO L225 Difference]: With dead ends: 46 [2018-12-31 05:25:14,872 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 05:25:14,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-31 05:25:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 05:25:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 05:25:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 05:25:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 05:25:14,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-12-31 05:25:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:14,875 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 05:25:14,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 05:25:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 05:25:14,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 05:25:14,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 05:25:15,137 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2018-12-31 05:25:15,147 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 590) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 590) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2018-12-31 05:25:15,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 05:25:15,149 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)))))) [2018-12-31 05:25:15,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 05:25:15,149 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2018-12-31 05:25:15,149 INFO L448 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2018-12-31 05:25:15,149 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 591) no Hoare annotation was computed. [2018-12-31 05:25:15,149 INFO L448 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-12-31 05:25:15,149 INFO L448 ceAbstractionStarter]: For program point L584-1(lines 584 588) no Hoare annotation was computed. [2018-12-31 05:25:15,149 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) [2018-12-31 05:25:15,150 INFO L448 ceAbstractionStarter]: For program point L584-4(lines 584 588) no Hoare annotation was computed. [2018-12-31 05:25:15,159 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,160 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,161 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,161 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,173 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,174 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,174 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,175 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:25:15 BoogieIcfgContainer [2018-12-31 05:25:15,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:25:15,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:25:15,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:25:15,186 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:25:15,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:24:50" (3/4) ... [2018-12-31 05:25:15,193 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 05:25:15,206 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 05:25:15,206 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 05:25:15,206 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 05:25:15,256 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:25:15,257 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:25:15,258 INFO L168 Benchmark]: Toolchain (without parser) took 26348.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 948.7 MB in the beginning and 963.5 MB in the end (delta: -14.9 MB). Peak memory consumption was 279.3 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:15,259 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-31 05:25:15,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:15,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:15,260 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:15,260 INFO L168 Benchmark]: RCFGBuilder took 602.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:15,261 INFO L168 Benchmark]: TraceAbstraction took 24897.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 972.6 MB in the end (delta: 102.8 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:15,261 INFO L168 Benchmark]: Witness Printer took 70.99 ms. Allocated memory is still 1.3 GB. Free memory was 972.6 MB in the beginning and 963.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:15,265 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.18 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 680.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 602.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24897.32 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 972.6 MB in the end (delta: 102.8 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.99 ms. Allocated memory is still 1.3 GB. Free memory was 972.6 MB in the beginning and 963.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. 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 [2018-12-31 05:25:15,271 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,271 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,272 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,278 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,286 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,286 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:25:15,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:25:15,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:25:15,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,292 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 [2018-12-31 05:25:15,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 05:25:15,295 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, 24.7s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.5s 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.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 10.6s 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, 21.2s 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...