./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-data/process_queue_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/process_queue_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 17ca2c4cfd3f3304aa1a07a698354da791c69868 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:51,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:22:51,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:22:51,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:22:51,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:22:51,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:22:51,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:22:51,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:22:51,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:22:51,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:22:51,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:22:51,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:22:51,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:22:51,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:22:51,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:22:51,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:22:51,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:22:51,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:22:51,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:22:51,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:22:51,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:22:51,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:22:51,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:22:51,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:22:51,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:22:51,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:22:51,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:22:51,183 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:22:51,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:22:51,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:22:51,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:22:51,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:22:51,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:22:51,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:22:51,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:22:51,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:22:51,189 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:22:51,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:22:51,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:22:51,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:22:51,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:22:51,214 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:22:51,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:22:51,214 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:22:51,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:22:51,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:22:51,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:22:51,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:22:51,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:22:51,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:22:51,215 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:22:51,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:22:51,216 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:22:51,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:22:51,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:22:51,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:22:51,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:22:51,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:22:51,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:22:51,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:22:51,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:22:51,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:22:51,217 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:22:51,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:22:51,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:22:51,218 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 -> 17ca2c4cfd3f3304aa1a07a698354da791c69868 [2018-12-31 05:22:51,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:22:51,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:22:51,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:22:51,279 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:22:51,280 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:22:51,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.i [2018-12-31 05:22:51,356 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628a52057/9a28b49ba2234d099f97536fa9bb8abd/FLAGbc0049100 [2018-12-31 05:22:51,859 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:22:51,859 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.i [2018-12-31 05:22:51,881 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628a52057/9a28b49ba2234d099f97536fa9bb8abd/FLAGbc0049100 [2018-12-31 05:22:52,137 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628a52057/9a28b49ba2234d099f97536fa9bb8abd [2018-12-31 05:22:52,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:22:52,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:22:52,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:22:52,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:22:52,154 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:22:52,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4f1937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52, skipping insertion in model container [2018-12-31 05:22:52,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:22:52,220 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:22:52,619 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:22:52,631 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:22:52,777 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:22:52,845 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:22:52,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52 WrapperNode [2018-12-31 05:22:52,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:22:52,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:22:52,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:22:52,848 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:22:52,858 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:22:52" (1/1) ... [2018-12-31 05:22:52,879 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:22:52" (1/1) ... [2018-12-31 05:22:52,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:22:52,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:22:52,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:22:52,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:22:52,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (1/1) ... [2018-12-31 05:22:52,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:22:52,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:22:52,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:22:52,949 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:22:52,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (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:22:53,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 05:22:53,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 05:22:53,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 05:22:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:22:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 05:22:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 05:22:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:22:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 05:22:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:22:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:22:53,574 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:22:53,574 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-31 05:22:53,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:22:53 BoogieIcfgContainer [2018-12-31 05:22:53,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:22:53,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:22:53,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:22:53,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:22:53,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:22:52" (1/3) ... [2018-12-31 05:22:53,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582c1762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:22:53, skipping insertion in model container [2018-12-31 05:22:53,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:22:52" (2/3) ... [2018-12-31 05:22:53,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582c1762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:22:53, skipping insertion in model container [2018-12-31 05:22:53,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:22:53" (3/3) ... [2018-12-31 05:22:53,586 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue_true-unreach-call.i [2018-12-31 05:22:53,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:22:53,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:22:53,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:22:53,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:22:53,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:22:53,669 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:22:53,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:22:53,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:22:53,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:22:53,670 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:22:53,670 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:22:53,670 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:22:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-12-31 05:22:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 05:22:53,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:22:53,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:22:53,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:22:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:22:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash 765962421, now seen corresponding path program 1 times [2018-12-31 05:22:53,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:22:53,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:22:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:53,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:53,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:22:53,918 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:22:53,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:22:53,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:22:53,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 05:22:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 05:22:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:22:53,941 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-12-31 05:22:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:22:54,030 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2018-12-31 05:22:54,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 05:22:54,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-31 05:22:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:22:54,048 INFO L225 Difference]: With dead ends: 49 [2018-12-31 05:22:54,049 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 05:22:54,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 05:22:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 05:22:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 05:22:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 05:22:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-12-31 05:22:54,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 10 [2018-12-31 05:22:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:22:54,093 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-12-31 05:22:54,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 05:22:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2018-12-31 05:22:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 05:22:54,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:22:54,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:22:54,095 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:22:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:22:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 708704119, now seen corresponding path program 1 times [2018-12-31 05:22:54,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:22:54,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:22:54,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:54,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:54,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:22:54,580 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:22:54,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:22:54,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 05:22:54,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:22:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:22:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:22:54,584 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2018-12-31 05:22:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:22:55,045 INFO L93 Difference]: Finished difference Result 91 states and 124 transitions. [2018-12-31 05:22:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:22:55,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-31 05:22:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:22:55,049 INFO L225 Difference]: With dead ends: 91 [2018-12-31 05:22:55,050 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 05:22:55,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:22:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 05:22:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-12-31 05:22:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 05:22:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2018-12-31 05:22:55,064 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 10 [2018-12-31 05:22:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:22:55,064 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2018-12-31 05:22:55,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:22:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2018-12-31 05:22:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 05:22:55,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:22:55,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:22:55,066 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:22:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:22:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1941169483, now seen corresponding path program 1 times [2018-12-31 05:22:55,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:22:55,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:22:55,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:55,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:55,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:22:55,172 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:22:55,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:22:55,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:22:55,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:22:55,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:22:55,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:22:55,174 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand 4 states. [2018-12-31 05:22:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:22:55,265 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2018-12-31 05:22:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:22:55,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 05:22:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:22:55,268 INFO L225 Difference]: With dead ends: 121 [2018-12-31 05:22:55,269 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 05:22:55,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:22:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 05:22:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-31 05:22:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 05:22:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2018-12-31 05:22:55,292 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 11 [2018-12-31 05:22:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:22:55,293 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2018-12-31 05:22:55,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:22:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2018-12-31 05:22:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 05:22:55,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:22:55,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:22:55,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:22:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:22:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 578790451, now seen corresponding path program 1 times [2018-12-31 05:22:55,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:22:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:22:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:22:55,396 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:22:55,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:22:55,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:22:55,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:22:55,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:22:55,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:22:55,398 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand 4 states. [2018-12-31 05:22:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:22:55,540 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2018-12-31 05:22:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:22:55,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 05:22:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:22:55,545 INFO L225 Difference]: With dead ends: 145 [2018-12-31 05:22:55,545 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 05:22:55,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:22:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 05:22:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-12-31 05:22:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-31 05:22:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2018-12-31 05:22:55,560 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 11 [2018-12-31 05:22:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:22:55,560 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2018-12-31 05:22:55,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:22:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2018-12-31 05:22:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 05:22:55,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:22:55,561 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:22:55,564 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:22:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:22:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1050906354, now seen corresponding path program 1 times [2018-12-31 05:22:55,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:22:55,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:22:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:55,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:22:55,966 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-12-31 05:22:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:22:56,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:22:56,149 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:22:56,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:22:56,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:22:56,410 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:22:56,428 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:22:56,529 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:22:56,568 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:22:56,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:56,724 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 26 treesize of output 27 [2018-12-31 05:22:56,732 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 15 treesize of output 18 [2018-12-31 05:22:56,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-31 05:22:56,746 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:56,754 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:56,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:56,888 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:22:56,915 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:22:57,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2018-12-31 05:22:57,153 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 47 treesize of output 52 [2018-12-31 05:22:57,154 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,326 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 42 treesize of output 41 [2018-12-31 05:22:57,327 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,518 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:22:57,523 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 44 treesize of output 39 [2018-12-31 05:22:57,531 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 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-31 05:22:57,531 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,553 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:22:57,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2018-12-31 05:22:57,756 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 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-31 05:22:57,757 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,774 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,845 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:22:57,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2018-12-31 05:22:57,866 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 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-31 05:22:57,867 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,883 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,903 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:57,968 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 58 [2018-12-31 05:22:57,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-31 05:22:57,987 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 14 treesize of output 15 [2018-12-31 05:22:57,988 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:57,999 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 66 [2018-12-31 05:22:58,167 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 52 treesize of output 59 [2018-12-31 05:22:58,168 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,274 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 49 treesize of output 48 [2018-12-31 05:22:58,275 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,373 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 48 treesize of output 49 [2018-12-31 05:22:58,382 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-31 05:22:58,383 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,399 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,463 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 51 treesize of output 46 [2018-12-31 05:22:58,470 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 32 treesize of output 30 [2018-12-31 05:22:58,471 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,488 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,588 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,598 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:22:58,627 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 8 variables, input treesize:156, output treesize:45 [2018-12-31 05:22:58,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,713 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:22:58,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-12-31 05:22:58,729 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 34 treesize of output 23 [2018-12-31 05:22:58,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,754 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:22:58,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-31 05:22:58,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:22:58,834 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 32 treesize of output 26 [2018-12-31 05:22:58,862 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:22:58,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-31 05:22:58,864 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,875 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 7 treesize of output 1 [2018-12-31 05:22:58,876 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:22:58,887 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2018-12-31 05:22:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:22:58,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:22:58,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-12-31 05:22:58,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 05:22:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 05:22:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=64, Unknown=4, NotChecked=0, Total=90 [2018-12-31 05:22:58,921 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 10 states. [2018-12-31 05:22:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:22:59,890 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-12-31 05:22:59,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 05:22:59,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-31 05:22:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:22:59,894 INFO L225 Difference]: With dead ends: 164 [2018-12-31 05:22:59,894 INFO L226 Difference]: Without dead ends: 105 [2018-12-31 05:22:59,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=151, Unknown=4, NotChecked=0, Total=210 [2018-12-31 05:22:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-31 05:22:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2018-12-31 05:22:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-31 05:22:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2018-12-31 05:22:59,915 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 13 [2018-12-31 05:22:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:22:59,915 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2018-12-31 05:22:59,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 05:22:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-12-31 05:22:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 05:22:59,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:22:59,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:22:59,918 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:22:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:22:59,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2100423790, now seen corresponding path program 1 times [2018-12-31 05:22:59,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:22:59,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:22:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:22:59,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:22:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:23:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:23:00,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:23:00,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:23:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:23:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:23:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:23:00,171 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 4 states. [2018-12-31 05:23:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:23:00,300 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2018-12-31 05:23:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:23:00,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 05:23:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:23:00,303 INFO L225 Difference]: With dead ends: 161 [2018-12-31 05:23:00,303 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 05:23:00,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:23:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 05:23:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-12-31 05:23:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 05:23:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2018-12-31 05:23:00,320 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 17 [2018-12-31 05:23:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:23:00,322 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-12-31 05:23:00,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:23:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-12-31 05:23:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 05:23:00,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:23:00,324 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:23:00,324 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:23:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:23:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash 32961051, now seen corresponding path program 1 times [2018-12-31 05:23:00,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:23:00,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:23:00,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:23:00,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:23:00,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:23:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:23:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:23:00,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:23:00,733 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:23:00,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:23:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:23:00,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:23:00,837 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:23:00,846 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:23:00,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-12-31 05:23:00,898 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 14 treesize of output 17 [2018-12-31 05:23:00,907 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 17 treesize of output 19 [2018-12-31 05:23:00,971 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 19 treesize of output 22 [2018-12-31 05:23:00,972 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:00,987 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:01,054 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 37 treesize of output 38 [2018-12-31 05:23:01,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 05:23:01,082 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,097 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:01,157 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-12-31 05:23:01,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:23:01,186 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:01,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-31 05:23:01,362 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 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-31 05:23:01,363 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,385 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,388 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:01,423 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-12-31 05:23:01,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:23:01,428 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:01,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-31 05:23:01,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-31 05:23:01,450 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,457 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,461 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,491 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:118, output treesize:31 [2018-12-31 05:23:01,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-31 05:23:01,522 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 22 treesize of output 13 [2018-12-31 05:23:01,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-31 05:23:01,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 05:23:01,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2018-12-31 05:23:01,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-31 05:23:01,568 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 11 treesize of output 7 [2018-12-31 05:23:01,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:01,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 05:23:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:23:01,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:23:01,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-31 05:23:01,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 05:23:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 05:23:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:23:01,608 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 11 states. [2018-12-31 05:23:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:23:02,778 INFO L93 Difference]: Finished difference Result 239 states and 308 transitions. [2018-12-31 05:23:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 05:23:02,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-31 05:23:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:23:02,782 INFO L225 Difference]: With dead ends: 239 [2018-12-31 05:23:02,782 INFO L226 Difference]: Without dead ends: 171 [2018-12-31 05:23:02,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-12-31 05:23:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-31 05:23:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-12-31 05:23:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-31 05:23:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2018-12-31 05:23:02,804 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 20 [2018-12-31 05:23:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:23:02,804 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2018-12-31 05:23:02,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 05:23:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2018-12-31 05:23:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 05:23:02,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:23:02,806 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 05:23:02,807 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:23:02,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:23:02,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1600928790, now seen corresponding path program 2 times [2018-12-31 05:23:02,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:23:02,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:23:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:23:02,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:23:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:23:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:23:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:23:03,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:23:03,271 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:23:03,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:23:03,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:23:03,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:23:03,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:23:03,549 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 6 treesize of output 5 [2018-12-31 05:23:03,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:03,590 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-12-31 05:23:03,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-31 05:23:03,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:03,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-31 05:23:03,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-31 05:23:03,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:03,686 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-12-31 05:23:03,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-31 05:23:03,690 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:03,707 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 27 treesize of output 30 [2018-12-31 05:23:03,711 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 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-31 05:23:03,711 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,717 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,720 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:03,735 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:30 [2018-12-31 05:23:03,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:03,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:03,955 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 15 treesize of output 8 [2018-12-31 05:23:03,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:04,325 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 39 treesize of output 44 [2018-12-31 05:23:04,335 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 18 treesize of output 21 [2018-12-31 05:23:04,361 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 21 treesize of output 23 [2018-12-31 05:23:04,428 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 23 treesize of output 15 [2018-12-31 05:23:04,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:04,476 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:04,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:04,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:04,814 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:04,831 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:04,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-12-31 05:23:05,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 05:23:05,034 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,087 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 73 [2018-12-31 05:23:05,317 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 24 treesize of output 22 [2018-12-31 05:23:05,317 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-12-31 05:23:05,389 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 39 treesize of output 31 [2018-12-31 05:23:05,390 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:23:05,444 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-12-31 05:23:05,445 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,480 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,551 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 53 treesize of output 54 [2018-12-31 05:23:05,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-31 05:23:05,559 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,591 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,624 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,738 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 40 treesize of output 45 [2018-12-31 05:23:05,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-31 05:23:05,743 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,763 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,821 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:05,826 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:05,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,899 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 47 treesize of output 72 [2018-12-31 05:23:05,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-31 05:23:05,905 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,921 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:05,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:05,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-12-31 05:23:05,986 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 32 treesize of output 34 [2018-12-31 05:23:05,986 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:06,013 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 34 treesize of output 39 [2018-12-31 05:23:06,018 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:23:06,019 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,027 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:06,049 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 58 treesize of output 48 [2018-12-31 05:23:06,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 35 treesize of output 29 [2018-12-31 05:23:06,071 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-12-31 05:23:06,162 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,206 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,219 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,287 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 12 variables, input treesize:222, output treesize:77 [2018-12-31 05:23:06,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:06,372 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 78 [2018-12-31 05:23:06,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:23:06,376 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 36 treesize of output 28 [2018-12-31 05:23:06,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,398 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 38 treesize of output 30 [2018-12-31 05:23:06,400 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:23:06,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:06,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:06,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-31 05:23:06,453 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 15 treesize of output 5 [2018-12-31 05:23:06,454 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-31 05:23:06,505 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,522 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:106, output treesize:11 [2018-12-31 05:23:06,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-31 05:23:06,555 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 11 treesize of output 7 [2018-12-31 05:23:06,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:06,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 05:23:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:23:06,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:23:06,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-12-31 05:23:06,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 05:23:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 05:23:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-12-31 05:23:06,599 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand 19 states. [2018-12-31 05:23:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:23:09,595 INFO L93 Difference]: Finished difference Result 470 states and 619 transitions. [2018-12-31 05:23:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-31 05:23:09,595 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-31 05:23:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:23:09,598 INFO L225 Difference]: With dead ends: 470 [2018-12-31 05:23:09,598 INFO L226 Difference]: Without dead ends: 468 [2018-12-31 05:23:09,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2018-12-31 05:23:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-31 05:23:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 174. [2018-12-31 05:23:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-31 05:23:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 222 transitions. [2018-12-31 05:23:09,625 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 222 transitions. Word has length 23 [2018-12-31 05:23:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:23:09,626 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 222 transitions. [2018-12-31 05:23:09,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 05:23:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 222 transitions. [2018-12-31 05:23:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 05:23:09,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:23:09,627 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 05:23:09,627 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:23:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:23:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1948816453, now seen corresponding path program 3 times [2018-12-31 05:23:09,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:23:09,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:23:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:23:09,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:23:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:23:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:23:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:23:10,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:23:10,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:23:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:23:10,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-31 05:23:10,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:23:10,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:23:10,504 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 6 treesize of output 5 [2018-12-31 05:23:10,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:10,628 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:23:10,642 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:23:10,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:10,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:10,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:10,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:10,879 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:23:10,892 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:23:10,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:10,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 52 [2018-12-31 05:23:10,969 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 30 treesize of output 29 [2018-12-31 05:23:10,975 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 29 treesize of output 29 [2018-12-31 05:23:10,976 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:10,989 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,024 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 26 treesize of output 27 [2018-12-31 05:23:11,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-31 05:23:11,029 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,040 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,127 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 36 treesize of output 30 [2018-12-31 05:23:11,131 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 12 [2018-12-31 05:23:11,132 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,156 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 19 treesize of output 22 [2018-12-31 05:23:11,157 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,181 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,193 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 60 [2018-12-31 05:23:11,250 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 38 treesize of output 37 [2018-12-31 05:23:11,294 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 37 treesize of output 45 [2018-12-31 05:23:11,295 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,376 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,397 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:23:11,402 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 41 treesize of output 44 [2018-12-31 05:23:11,405 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 0 case distinctions, treesize of input 14 treesize of output 19 [2018-12-31 05:23:11,406 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,415 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,432 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 45 treesize of output 33 [2018-12-31 05:23:11,438 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 14 treesize of output 12 [2018-12-31 05:23:11,439 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:11,455 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 23 treesize of output 34 [2018-12-31 05:23:11,456 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,465 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,474 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,502 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 8 variables, input treesize:160, output treesize:49 [2018-12-31 05:23:11,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:11,669 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 15 treesize of output 8 [2018-12-31 05:23:11,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:11,818 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:23:11,828 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:23:11,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:11,924 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:12,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-12-31 05:23:12,033 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 15 treesize of output 18 [2018-12-31 05:23:12,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-31 05:23:12,042 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,049 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,065 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,124 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:12,129 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:12,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-31 05:23:12,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-12-31 05:23:12,199 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,229 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:23:12,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-12-31 05:23:12,238 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-12-31 05:23:12,238 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,259 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,271 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 106 [2018-12-31 05:23:12,347 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 30 treesize of output 29 [2018-12-31 05:23:12,352 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 29 treesize of output 29 [2018-12-31 05:23:12,352 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,404 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 72 [2018-12-31 05:23:12,447 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 22 [2018-12-31 05:23:12,449 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:23:12,472 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:23:12,473 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-31 05:23:12,498 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,515 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,546 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 43 treesize of output 44 [2018-12-31 05:23:12,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 11 [2018-12-31 05:23:12,559 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,573 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,591 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:12,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:12,615 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 8 variables, input treesize:188, output treesize:55 [2018-12-31 05:23:12,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:12,887 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:23:12,988 INFO L303 Elim1Store]: Index analysis took 263 ms [2018-12-31 05:23:12,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 135 [2018-12-31 05:23:13,017 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:23:13,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 50 [2018-12-31 05:23:13,021 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:23:13,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-31 05:23:13,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,307 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 17 treesize of output 1 [2018-12-31 05:23:13,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:23:13,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:13,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:23:13,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-12-31 05:23:13,342 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 13 treesize of output 1 [2018-12-31 05:23:13,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,356 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 13 treesize of output 5 [2018-12-31 05:23:13,356 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,361 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:23:13,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:23:13,372 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:126, output treesize:1 [2018-12-31 05:23:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:23:13,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:23:13,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-12-31 05:23:13,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 05:23:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 05:23:13,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=199, Unknown=8, NotChecked=0, Total=240 [2018-12-31 05:23:13,403 INFO L87 Difference]: Start difference. First operand 174 states and 222 transitions. Second operand 16 states. [2018-12-31 05:23:15,137 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2018-12-31 05:23:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:23:16,239 INFO L93 Difference]: Finished difference Result 399 states and 519 transitions. [2018-12-31 05:23:16,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 05:23:16,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-12-31 05:23:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:23:16,242 INFO L225 Difference]: With dead ends: 399 [2018-12-31 05:23:16,242 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 05:23:16,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=95, Invalid=493, Unknown=12, NotChecked=0, Total=600 [2018-12-31 05:23:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 05:23:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 05:23:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 05:23:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 05:23:16,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-12-31 05:23:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:23:16,245 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 05:23:16,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 05:23:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 05:23:16,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 05:23:16,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 05:23:16,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,453 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 111 [2018-12-31 05:23:16,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:16,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 05:23:17,720 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 103 DAG size of output: 14 [2018-12-31 05:23:18,420 WARN L181 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 10 [2018-12-31 05:23:18,689 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 14 [2018-12-31 05:23:18,877 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 25 [2018-12-31 05:23:18,880 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 580) no Hoare annotation was computed. [2018-12-31 05:23:18,880 INFO L448 ceAbstractionStarter]: For program point L572-1(lines 572 580) no Hoare annotation was computed. [2018-12-31 05:23:18,880 INFO L448 ceAbstractionStarter]: For program point L601(lines 601 605) no Hoare annotation was computed. [2018-12-31 05:23:18,880 INFO L448 ceAbstractionStarter]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 607) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L444 ceAbstractionStarter]: At program point L594-3(lines 594 607) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_main_~#queue~0.offset|)) (.cse1 (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|))) (or (and .cse0 (= 1 ULTIMATE.start_main_~next_time~0) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#queue~0.base|) |ULTIMATE.start_main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#queue~0.base|) |ULTIMATE.start_main_~#queue~0.offset|)) .cse1) (and .cse0 (= ULTIMATE.start_check_queue_~n~0.offset 0) (= ULTIMATE.start_check_queue_~n~0.base 0) (<= 1 ULTIMATE.start_main_~next_time~0) .cse1))) [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point L594-4(lines 594 607) no Hoare annotation was computed. [2018-12-31 05:23:18,881 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 590) no Hoare annotation was computed. [2018-12-31 05:23:18,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 589) no Hoare annotation was computed. [2018-12-31 05:23:18,885 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 05:23:18,885 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 577) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 608) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 589) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L444 ceAbstractionStarter]: At program point L587-3(lines 587 589) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#queue~0.offset|) (<= 1 ULTIMATE.start_main_~next_time~0) (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|)) [2018-12-31 05:23:18,886 INFO L444 ceAbstractionStarter]: At program point L571-2(lines 571 583) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#queue~0.offset|) (<= 2 ULTIMATE.start_main_~next_time~0) (= ULTIMATE.start_check_queue_~n~0.offset 0) (= ULTIMATE.start_check_queue_~n~0.base 0) (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|)) [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L571-3(lines 571 583) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 589) no Hoare annotation was computed. [2018-12-31 05:23:18,886 INFO L444 ceAbstractionStarter]: At program point L584(lines 567 585) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#queue~0.offset|) (<= 2 ULTIMATE.start_main_~next_time~0) (= ULTIMATE.start_check_queue_~n~0.offset 0) (= ULTIMATE.start_check_queue_~n~0.base 0) (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|)) [2018-12-31 05:23:18,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,908 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:23:18,909 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:23:18,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:23:18,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:23:18,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:18,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:18,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:18,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:23:18 BoogieIcfgContainer [2018-12-31 05:23:18,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:23:18,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:23:18,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:23:18,917 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:23:18,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:22:53" (3/4) ... [2018-12-31 05:23:18,922 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 05:23:18,934 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-31 05:23:18,935 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 05:23:18,935 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 05:23:18,995 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:23:18,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:23:19,000 INFO L168 Benchmark]: Toolchain (without parser) took 26855.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 940.6 MB in the beginning and 1.3 GB in the end (delta: -379.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:23:19,001 INFO L168 Benchmark]: CDTParser took 0.21 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:23:19,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:23:19,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:23:19,002 INFO L168 Benchmark]: Boogie Preprocessor took 36.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:23:19,002 INFO L168 Benchmark]: RCFGBuilder took 626.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:23:19,002 INFO L168 Benchmark]: TraceAbstraction took 25340.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -230.3 MB). Peak memory consumption was 417.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:23:19,005 INFO L168 Benchmark]: Witness Printer took 81.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-31 05:23:19,007 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.21 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 699.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 626.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25340.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -230.3 MB). Peak memory consumption was 417.7 MB. Max. memory is 11.5 GB. * Witness Printer took 81.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 589]: 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: 571]: Loop Invariant [2018-12-31 05:23:19,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:19,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((0 == queue && 2 <= next_time) && n == 0) && n == 0) && queue < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 567]: Loop Invariant [2018-12-31 05:23:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((0 == queue && 2 <= next_time) && n == 0) && n == 0) && queue < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 587]: Loop Invariant [2018-12-31 05:23:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:19,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (0 == queue && 1 <= next_time) && queue < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 594]: Loop Invariant [2018-12-31 05:23:19,026 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:23:19,026 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:23:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:19,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-31 05:23:19,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 05:23:19,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:19,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 05:23:19,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2018-12-31 05:23:19,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((0 == queue && 1 == next_time) && 0 == #memory_$Pointer$[queue][queue]) && 0 == #memory_$Pointer$[queue][queue]) && queue < unknown-#StackHeapBarrier-unknown) || ((((0 == queue && n == 0) && n == 0) && 1 <= next_time) && queue < unknown-#StackHeapBarrier-unknown) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 25.2s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 302 SDtfs, 894 SDslu, 1438 SDs, 0 SdLazy, 1251 SolverSat, 130 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 383 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 72 NumberOfFragments, 83 HoareAnnotationTreeSize, 4 FomulaSimplifications, 33452 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4012 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 210 ConstructedInterpolants, 14 QuantifiedInterpolants, 95489 SizeOfPredicates, 138 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 26/106 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...