./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/tree_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-manipulation/tree_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 e8c816154480634071eb5b358a84aead1db421f3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:08:27,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:08:27,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:08:27,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:08:27,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:08:27,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:08:27,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:08:27,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:08:27,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:08:27,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:08:27,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:08:27,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:08:27,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:08:27,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:08:27,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:08:27,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:08:27,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:08:27,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:08:27,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:08:27,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:08:27,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:08:27,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:08:27,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:08:27,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:08:27,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:08:27,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:08:27,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:08:27,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:08:27,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:08:27,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:08:27,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:08:27,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:08:27,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:08:27,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:08:27,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:08:27,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:08:27,279 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:08:27,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:08:27,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:08:27,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:08:27,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:08:27,297 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:08:27,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:08:27,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:08:27,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:08:27,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:08:27,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:08:27,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:08:27,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:08:27,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:08:27,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:08:27,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:08:27,300 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:08:27,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:08:27,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:08:27,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:08:27,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:08:27,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:08:27,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:08:27,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:08:27,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:08:27,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:08:27,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:08:27,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:08:27,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:08:27,305 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 -> e8c816154480634071eb5b358a84aead1db421f3 [2018-12-31 04:08:27,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:08:27,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:08:27,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:08:27,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:08:27,361 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:08:27,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/tree_true-unreach-call.i [2018-12-31 04:08:27,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f457761/bb21d38f09e440d5a31f27b0d93c9de0/FLAGf01059919 [2018-12-31 04:08:27,998 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:08:27,999 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/tree_true-unreach-call.i [2018-12-31 04:08:28,024 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f457761/bb21d38f09e440d5a31f27b0d93c9de0/FLAGf01059919 [2018-12-31 04:08:28,280 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f457761/bb21d38f09e440d5a31f27b0d93c9de0 [2018-12-31 04:08:28,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:08:28,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:08:28,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:08:28,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:08:28,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:08:28,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:08:28" (1/1) ... [2018-12-31 04:08:28,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5be00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:28, skipping insertion in model container [2018-12-31 04:08:28,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:08:28" (1/1) ... [2018-12-31 04:08:28,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:08:28,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:08:28,790 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:08:28,810 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:08:28,986 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:08:29,061 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:08:29,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29 WrapperNode [2018-12-31 04:08:29,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:08:29,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:08:29,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:08:29,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:08:29,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:08:29,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:08:29,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:08:29,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:08:29,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (1/1) ... [2018-12-31 04:08:29,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:08:29,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:08:29,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:08:29,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:08:29,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (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 04:08:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:08:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:08:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 04:08:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:08:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:08:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:08:29,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:08:29,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:08:30,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:08:30,048 INFO L280 CfgBuilder]: Removed 27 assue(true) statements. [2018-12-31 04:08:30,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:08:30 BoogieIcfgContainer [2018-12-31 04:08:30,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:08:30,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:08:30,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:08:30,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:08:30,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:08:28" (1/3) ... [2018-12-31 04:08:30,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e12cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:08:30, skipping insertion in model container [2018-12-31 04:08:30,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:08:29" (2/3) ... [2018-12-31 04:08:30,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e12cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:08:30, skipping insertion in model container [2018-12-31 04:08:30,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:08:30" (3/3) ... [2018-12-31 04:08:30,058 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_true-unreach-call.i [2018-12-31 04:08:30,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:08:30,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 04:08:30,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 04:08:30,135 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:08:30,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:08:30,136 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:08:30,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:08:30,136 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:08:30,136 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:08:30,137 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:08:30,137 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:08:30,137 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:08:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-31 04:08:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:08:30,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:30,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:30,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1437310363, now seen corresponding path program 1 times [2018-12-31 04:08:30,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:30,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:30,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:30,316 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 04:08:30,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:08:30,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:08:30,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:08:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:08:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:08:30,342 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2018-12-31 04:08:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:30,362 INFO L93 Difference]: Finished difference Result 92 states and 148 transitions. [2018-12-31 04:08:30,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:08:30,363 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:08:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:30,374 INFO L225 Difference]: With dead ends: 92 [2018-12-31 04:08:30,374 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 04:08:30,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:08:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 04:08:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-31 04:08:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 04:08:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-31 04:08:30,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 10 [2018-12-31 04:08:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:30,412 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-31 04:08:30,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:08:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-31 04:08:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:08:30,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:30,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:30,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1902394293, now seen corresponding path program 1 times [2018-12-31 04:08:30,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:30,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:30,512 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 04:08:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:08:30,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:08:30,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:08:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:08:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:08:30,515 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-12-31 04:08:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:30,663 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-12-31 04:08:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:08:30,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-31 04:08:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:30,666 INFO L225 Difference]: With dead ends: 61 [2018-12-31 04:08:30,666 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:08:30,667 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 04:08:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:08:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 04:08:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 04:08:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-31 04:08:30,675 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 11 [2018-12-31 04:08:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:30,675 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-31 04:08:30,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:08:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-31 04:08:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:08:30,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:30,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:30,677 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash -617565641, now seen corresponding path program 1 times [2018-12-31 04:08:30,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:30,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:30,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:30,889 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 04:08:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:08:30,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:08:30,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:08:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:08:30,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:08:30,893 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2018-12-31 04:08:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:31,095 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-12-31 04:08:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:08:31,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-31 04:08:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:31,098 INFO L225 Difference]: With dead ends: 81 [2018-12-31 04:08:31,098 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 04:08:31,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:08:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 04:08:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-31 04:08:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 04:08:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-31 04:08:31,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 11 [2018-12-31 04:08:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:31,112 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-31 04:08:31,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:08:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-31 04:08:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:08:31,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:31,114 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:31,114 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash -199489304, now seen corresponding path program 1 times [2018-12-31 04:08:31,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:31,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:31,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:31,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:08:31,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:08:31,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:08:31,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:08:31,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:08:31,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:08:31,217 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2018-12-31 04:08:31,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:31,300 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-12-31 04:08:31,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:08:31,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 04:08:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:31,302 INFO L225 Difference]: With dead ends: 63 [2018-12-31 04:08:31,302 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 04:08:31,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 04:08:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 04:08:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-31 04:08:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 04:08:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-31 04:08:31,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 19 [2018-12-31 04:08:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:31,308 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-31 04:08:31,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:08:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-31 04:08:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 04:08:31,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:31,310 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:31,310 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1552949996, now seen corresponding path program 1 times [2018-12-31 04:08:31,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:31,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 04:08:31,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:08:31,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:08:31,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:08:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:08:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:08:31,685 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-31 04:08:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:32,213 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-12-31 04:08:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:08:32,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-31 04:08:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:32,216 INFO L225 Difference]: With dead ends: 89 [2018-12-31 04:08:32,216 INFO L226 Difference]: Without dead ends: 56 [2018-12-31 04:08:32,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:08:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-31 04:08:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-12-31 04:08:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 04:08:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-12-31 04:08:32,225 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 22 [2018-12-31 04:08:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:32,226 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-12-31 04:08:32,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:08:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-31 04:08:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:08:32,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:32,228 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:32,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1147750160, now seen corresponding path program 1 times [2018-12-31 04:08:32,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:32,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:32,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:32,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:32,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:32,645 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-31 04:08:33,118 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-12-31 04:08:33,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:08:33,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:08:33,488 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 04:08:33,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:33,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:08:33,597 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 04:08:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-31 04:08:33,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:33,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:33,720 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 11 treesize of output 4 [2018-12-31 04:08:33,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:08:33,781 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 04:08:33,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:08:33,824 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 04:08:33,825 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,844 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:33,858 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 04:08:33,859 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2018-12-31 04:08:34,937 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2018-12-31 04:08:34,943 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 04:08:35,024 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 04:08:35,139 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 04:08:35,188 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 04:08:35,323 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 1092 treesize of output 951 [2018-12-31 04:08:35,336 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 76 treesize of output 75 [2018-12-31 04:08:35,336 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:35,398 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 04:08:35,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 948 [2018-12-31 04:08:35,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:35,459 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 741 treesize of output 426 [2018-12-31 04:08:35,460 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:35,498 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:35,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:35,626 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 1942 treesize of output 758 [2018-12-31 04:08:35,804 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-12-31 04:08:35,808 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 25 treesize of output 28 [2018-12-31 04:08:35,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:35,814 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 28 treesize of output 47 [2018-12-31 04:08:35,815 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:35,836 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:35,931 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 363 treesize of output 347 [2018-12-31 04:08:35,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:35,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:35,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 248 [2018-12-31 04:08:36,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 541 [2018-12-31 04:08:36,056 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:36,121 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:36,150 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:36,180 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 04:08:36,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 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 362 treesize of output 201 [2018-12-31 04:08:36,300 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 103 treesize of output 91 [2018-12-31 04:08:36,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:36,306 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 91 treesize of output 104 [2018-12-31 04:08:36,307 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:36,323 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:36,378 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 75 treesize of output 73 [2018-12-31 04:08:36,384 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 47 treesize of output 43 [2018-12-31 04:08:36,385 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 04:08:36,412 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:36,484 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 135 treesize of output 109 [2018-12-31 04:08:36,501 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 101 treesize of output 72 [2018-12-31 04:08:36,502 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:36,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-31 04:08:36,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 65 [2018-12-31 04:08:36,636 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-12-31 04:08:36,783 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-31 04:08:37,036 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-31 04:08:37,212 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-31 04:08:37,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-31 04:08:37,355 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:2667, output treesize:327 [2018-12-31 04:08:37,645 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-31 04:08:38,034 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 92 treesize of output 86 [2018-12-31 04:08:38,038 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 15 treesize of output 13 [2018-12-31 04:08:38,039 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 04:08:38,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:08:38,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:38,109 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 04:08:38,180 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 107 treesize of output 82 [2018-12-31 04:08:38,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-31 04:08:38,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:38,229 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 60 treesize of output 48 [2018-12-31 04:08:38,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:38,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-31 04:08:38,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-31 04:08:38,514 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 1 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:08:38,514 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:38,527 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:08:38,627 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 60 treesize of output 52 [2018-12-31 04:08:38,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:38,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:38,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-31 04:08:38,636 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:38,650 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 9 [2018-12-31 04:08:38,651 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:38,662 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:38,666 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 51 treesize of output 43 [2018-12-31 04:08:38,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-31 04:08:38,701 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:38,736 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 9 [2018-12-31 04:08:38,737 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:38,755 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-31 04:08:38,909 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 92 treesize of output 69 [2018-12-31 04:08:38,914 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 16 treesize of output 3 [2018-12-31 04:08:38,914 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:38,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-12-31 04:08:38,931 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:38,944 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:39,043 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 42 treesize of output 36 [2018-12-31 04:08:39,046 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 9 [2018-12-31 04:08:39,047 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 04:08:39,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-31 04:08:39,063 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,071 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:39,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 20 [2018-12-31 04:08:39,173 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 1 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:08:39,173 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,181 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,283 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 48 treesize of output 33 [2018-12-31 04:08:39,289 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 6 treesize of output 4 [2018-12-31 04:08:39,290 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,300 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 16 treesize of output 3 [2018-12-31 04:08:39,301 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,306 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,310 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 45 treesize of output 30 [2018-12-31 04:08:39,313 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 16 treesize of output 3 [2018-12-31 04:08:39,314 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,323 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 6 treesize of output 4 [2018-12-31 04:08:39,323 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,327 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 23 [2018-12-31 04:08:39,416 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 1 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:08:39,417 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,427 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 29 [2018-12-31 04:08:39,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:08:39,439 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,449 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 32 [2018-12-31 04:08:39,556 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 1 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:08:39,557 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,568 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:08:39,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:39,717 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 16 variables, input treesize:292, output treesize:1 [2018-12-31 04:08:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:08:39,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:08:39,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-12-31 04:08:39,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 04:08:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 04:08:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:08:39,752 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 17 states. [2018-12-31 04:08:40,236 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-31 04:08:40,803 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-12-31 04:08:41,458 WARN L181 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2018-12-31 04:08:42,265 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2018-12-31 04:08:43,104 WARN L181 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 158 [2018-12-31 04:08:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:43,285 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-12-31 04:08:43,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:08:43,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-12-31 04:08:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:43,290 INFO L225 Difference]: With dead ends: 70 [2018-12-31 04:08:43,290 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 04:08:43,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-12-31 04:08:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 04:08:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 36. [2018-12-31 04:08:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 04:08:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-31 04:08:43,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2018-12-31 04:08:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:43,300 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-31 04:08:43,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 04:08:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-31 04:08:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:08:43,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:43,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:43,302 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1147042128, now seen corresponding path program 1 times [2018-12-31 04:08:43,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:43,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:43,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:43,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:08:43,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:08:43,703 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 04:08:43,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:43,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:08:43,753 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 04:08:43,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:43,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:43,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-31 04:08:43,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:43,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:43,783 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-31 04:08:43,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:43,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:08:43,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-31 04:08:43,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:43,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:43,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:43,820 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2018-12-31 04:08:43,863 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 110 treesize of output 100 [2018-12-31 04:08:43,869 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 100 treesize of output 90 [2018-12-31 04:08:43,870 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 04:08:43,873 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 04:08:43,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:43,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:145, output treesize:105 [2018-12-31 04:08:44,189 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 49 [2018-12-31 04:08:44,207 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 280 treesize of output 255 [2018-12-31 04:08:44,210 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 25 treesize of output 28 [2018-12-31 04:08:44,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,219 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 28 treesize of output 47 [2018-12-31 04:08:44,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:44,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:44,364 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 254 treesize of output 218 [2018-12-31 04:08:44,385 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 210 treesize of output 178 [2018-12-31 04:08:44,388 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 04:08:44,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,434 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 13 treesize of output 6 [2018-12-31 04:08:44,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:44,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:44,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:44,481 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:44,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:08:44,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 431 [2018-12-31 04:08:44,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 429 [2018-12-31 04:08:44,508 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 04:08:44,513 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 04:08:44,541 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 130 [2018-12-31 04:08:44,580 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 17 treesize of output 20 [2018-12-31 04:08:44,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,586 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 20 treesize of output 31 [2018-12-31 04:08:44,586 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:44,595 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:44,620 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 67 treesize of output 51 [2018-12-31 04:08:44,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,629 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-12-31 04:08:44,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:44,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 93 [2018-12-31 04:08:44,694 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-12-31 04:08:44,785 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-31 04:08:44,847 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-31 04:08:44,920 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-31 04:08:44,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-31 04:08:44,992 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:1057, output treesize:191 [2018-12-31 04:08:45,557 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-12-31 04:08:45,913 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-31 04:08:46,549 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-31 04:08:46,580 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 61 treesize of output 37 [2018-12-31 04:08:46,585 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-31 04:08:46,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:46,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 29 [2018-12-31 04:08:46,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-31 04:08:46,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:08:46,711 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 48 treesize of output 30 [2018-12-31 04:08:46,714 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-31 04:08:46,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:46,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-31 04:08:46,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,731 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,773 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 48 treesize of output 30 [2018-12-31 04:08:46,787 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-31 04:08:46,787 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:46,804 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 13 treesize of output 6 [2018-12-31 04:08:46,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,810 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:46,881 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:158, output treesize:4 [2018-12-31 04:08:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:08:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:08:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-12-31 04:08:46,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 04:08:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 04:08:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:08:46,919 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 14 states. [2018-12-31 04:08:48,385 WARN L181 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-12-31 04:08:52,888 WARN L181 SmtUtils]: Spent 4.46 s on a formula simplification that was a NOOP. DAG size: 115 [2018-12-31 04:08:55,555 WARN L181 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 149 [2018-12-31 04:08:59,095 WARN L181 SmtUtils]: Spent 3.47 s on a formula simplification that was a NOOP. DAG size: 152 [2018-12-31 04:08:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:08:59,214 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-12-31 04:08:59,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:08:59,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-31 04:08:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:08:59,217 INFO L225 Difference]: With dead ends: 79 [2018-12-31 04:08:59,217 INFO L226 Difference]: Without dead ends: 68 [2018-12-31 04:08:59,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:08:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-31 04:08:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2018-12-31 04:08:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 04:08:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-31 04:08:59,231 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 27 [2018-12-31 04:08:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:08:59,231 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-31 04:08:59,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 04:08:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-31 04:08:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 04:08:59,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:08:59,234 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:08:59,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:08:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:08:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash -384468434, now seen corresponding path program 1 times [2018-12-31 04:08:59,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:08:59,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:08:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:59,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:08:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:08:59,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:08:59,565 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 04:08:59,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:08:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:08:59,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:08:59,636 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 04:08:59,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-31 04:08:59,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:08:59,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:08:59,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-31 04:08:59,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-12-31 04:08:59,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:59,924 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 24 treesize of output 33 [2018-12-31 04:08:59,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2018-12-31 04:08:59,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:59,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:08:59,949 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 11 treesize of output 4 [2018-12-31 04:08:59,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:08:59,973 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 04:08:59,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:08:59,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:00,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-31 04:09:00,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:00,011 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 20 treesize of output 27 [2018-12-31 04:09:00,012 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:00,016 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:00,027 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 04:09:00,027 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:27 [2018-12-31 04:09:00,982 WARN L181 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 72 [2018-12-31 04:09:00,984 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 04:09:00,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,049 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 841 treesize of output 405 [2018-12-31 04:09:01,117 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 25 treesize of output 28 [2018-12-31 04:09:01,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:01,125 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 28 treesize of output 47 [2018-12-31 04:09:01,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,174 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 192 treesize of output 161 [2018-12-31 04:09:01,180 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 136 treesize of output 112 [2018-12-31 04:09:01,181 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 04:09:01,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:01,218 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 21 treesize of output 14 [2018-12-31 04:09:01,219 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,249 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-31 04:09:01,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-12-31 04:09:01,319 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,329 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 53 [2018-12-31 04:09:01,359 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 53 treesize of output 49 [2018-12-31 04:09:01,360 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,364 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-12-31 04:09:01,400 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 1 [2018-12-31 04:09:01,400 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,410 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,439 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 57 treesize of output 58 [2018-12-31 04:09:01,442 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 46 treesize of output 49 [2018-12-31 04:09:01,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 67 [2018-12-31 04:09:01,464 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-31 04:09:01,471 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:09:01,485 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-31 04:09:01,522 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 42 treesize of output 46 [2018-12-31 04:09:01,525 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 21 treesize of output 24 [2018-12-31 04:09:01,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:01,528 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 24 treesize of output 39 [2018-12-31 04:09:01,529 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,541 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,567 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 38 treesize of output 32 [2018-12-31 04:09:01,572 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 28 treesize of output 22 [2018-12-31 04:09:01,573 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:01,589 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 13 treesize of output 6 [2018-12-31 04:09:01,589 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,596 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,602 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:01,611 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 40 treesize of output 44 [2018-12-31 04:09:01,614 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 21 treesize of output 24 [2018-12-31 04:09:01,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:01,619 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 24 treesize of output 39 [2018-12-31 04:09:01,619 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,629 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,747 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 04:09:01,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-12-31 04:09:01,762 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:01,775 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 13 treesize of output 6 [2018-12-31 04:09:01,775 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,778 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,805 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,845 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:1901, output treesize:11 [2018-12-31 04:09:01,890 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 04:09:01,907 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 04:09:01,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:01,955 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 04:09:01,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-31 04:09:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:01,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:09:01,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 04:09:01,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:09:01,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:09:01,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:09:01,999 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2018-12-31 04:09:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:09:03,042 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-12-31 04:09:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:09:03,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-12-31 04:09:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:09:03,044 INFO L225 Difference]: With dead ends: 88 [2018-12-31 04:09:03,044 INFO L226 Difference]: Without dead ends: 86 [2018-12-31 04:09:03,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:09:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-31 04:09:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2018-12-31 04:09:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 04:09:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-12-31 04:09:03,065 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 30 [2018-12-31 04:09:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:09:03,065 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-12-31 04:09:03,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:09:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-12-31 04:09:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 04:09:03,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:09:03,069 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:09:03,070 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:09:03,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:09:03,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1885049124, now seen corresponding path program 2 times [2018-12-31 04:09:03,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:09:03,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:09:03,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:09:03,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:09:03,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:09:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:09:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:03,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:09:03,650 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 04:09:03,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:09:03,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:09:03,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:09:03,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:09:03,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-31 04:09:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-31 04:09:03,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:09:03,868 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 13 treesize of output 16 [2018-12-31 04:09:03,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:03,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:09:03,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-31 04:09:03,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-31 04:09:03,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:03,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:09:03,935 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,975 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,980 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:03,992 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:38, output treesize:38 [2018-12-31 04:09:04,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-31 04:09:04,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-31 04:09:04,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-31 04:09:04,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-31 04:09:04,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:38 [2018-12-31 04:09:04,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-31 04:09:04,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,123 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 46 [2018-12-31 04:09:04,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-31 04:09:04,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,169 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 46 [2018-12-31 04:09:04,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-12-31 04:09:04,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,238 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 11 treesize of output 4 [2018-12-31 04:09:04,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-12-31 04:09:04,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-12-31 04:09:04,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-12-31 04:09:04,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:04,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-12-31 04:09:04,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:04,426 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:83, output treesize:45 [2018-12-31 04:09:04,998 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 61 [2018-12-31 04:09:04,999 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 04:09:05,005 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 04:09:05,041 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 04:09:05,045 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 04:09:05,086 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 191 [2018-12-31 04:09:05,133 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 25 treesize of output 28 [2018-12-31 04:09:05,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,138 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 28 treesize of output 47 [2018-12-31 04:09:05,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,145 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,167 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 144 treesize of output 121 [2018-12-31 04:09:05,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,171 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 21 treesize of output 14 [2018-12-31 04:09:05,172 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2018-12-31 04:09:05,203 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 04:09:05,219 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:05,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:05,258 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 79 treesize of output 83 [2018-12-31 04:09:05,262 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 52 treesize of output 47 [2018-12-31 04:09:05,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,265 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 55 [2018-12-31 04:09:05,265 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,276 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,297 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 68 treesize of output 60 [2018-12-31 04:09:05,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 40 [2018-12-31 04:09:05,306 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:05,317 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:05,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 13 [2018-12-31 04:09:05,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:05,328 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 13 treesize of output 6 [2018-12-31 04:09:05,328 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,330 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,331 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:05,336 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:1893, output treesize:7 [2018-12-31 04:09:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:09:05,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-12-31 04:09:05,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 04:09:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 04:09:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:09:05,374 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 14 states. [2018-12-31 04:09:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:09:05,976 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2018-12-31 04:09:05,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:09:05,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-12-31 04:09:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:09:05,982 INFO L225 Difference]: With dead ends: 133 [2018-12-31 04:09:05,986 INFO L226 Difference]: Without dead ends: 114 [2018-12-31 04:09:05,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:09:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-31 04:09:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2018-12-31 04:09:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-31 04:09:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-12-31 04:09:06,021 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 30 [2018-12-31 04:09:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:09:06,021 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-12-31 04:09:06,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 04:09:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-12-31 04:09:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 04:09:06,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:09:06,023 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:09:06,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:09:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:09:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash -165613716, now seen corresponding path program 1 times [2018-12-31 04:09:06,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:09:06,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:09:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:09:06,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:09:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:09:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:09:06,435 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-12-31 04:09:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:06,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:09:06,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:09:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:09:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:09:06,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:09:06,823 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 04:09:06,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-31 04:09:06,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:09:06,842 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 10 treesize of output 9 [2018-12-31 04:09:06,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,854 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 04:09:06,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-31 04:09:06,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-12-31 04:09:06,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:06,896 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 25 treesize of output 34 [2018-12-31 04:09:06,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-12-31 04:09:06,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:06,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:06,927 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 11 treesize of output 4 [2018-12-31 04:09:06,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-31 04:09:06,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:06,979 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 21 treesize of output 28 [2018-12-31 04:09:06,979 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:06,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:07,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 04:09:07,004 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 04:09:07,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:07,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:07,016 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 04:09:07,017 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:56, output treesize:28 [2018-12-31 04:09:08,150 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 186 DAG size of output: 72 [2018-12-31 04:09:08,172 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 349 [2018-12-31 04:09:08,179 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 25 treesize of output 28 [2018-12-31 04:09:08,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,186 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 28 treesize of output 47 [2018-12-31 04:09:08,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,263 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 353 treesize of output 273 [2018-12-31 04:09:08,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,286 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 111 treesize of output 135 [2018-12-31 04:09:08,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,394 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 04:09:08,400 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 04:09:08,441 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 55 treesize of output 56 [2018-12-31 04:09:08,458 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 39 treesize of output 42 [2018-12-31 04:09:08,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,521 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 42 treesize of output 30 [2018-12-31 04:09:08,522 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,552 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,602 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 101 treesize of output 96 [2018-12-31 04:09:08,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,610 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 80 treesize of output 125 [2018-12-31 04:09:08,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 164 [2018-12-31 04:09:08,648 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-12-31 04:09:08,699 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-31 04:09:08,732 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-31 04:09:08,791 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 100 treesize of output 104 [2018-12-31 04:09:08,794 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 25 treesize of output 28 [2018-12-31 04:09:08,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,798 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 28 treesize of output 47 [2018-12-31 04:09:08,799 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,805 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,830 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 95 treesize of output 79 [2018-12-31 04:09:08,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,835 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 17 treesize of output 10 [2018-12-31 04:09:08,836 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,847 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 55 treesize of output 52 [2018-12-31 04:09:08,848 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,856 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,868 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,879 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 100 treesize of output 104 [2018-12-31 04:09:08,884 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 25 treesize of output 28 [2018-12-31 04:09:08,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,889 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 28 treesize of output 47 [2018-12-31 04:09:08,889 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,895 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:08,920 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 95 treesize of output 79 [2018-12-31 04:09:08,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:08,984 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 17 treesize of output 10 [2018-12-31 04:09:08,985 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,085 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 55 treesize of output 50 [2018-12-31 04:09:09,085 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,094 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,105 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,112 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 102 treesize of output 106 [2018-12-31 04:09:09,115 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 25 treesize of output 28 [2018-12-31 04:09:09,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:09,120 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 28 treesize of output 47 [2018-12-31 04:09:09,120 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,131 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,154 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 97 treesize of output 81 [2018-12-31 04:09:09,158 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 73 treesize of output 61 [2018-12-31 04:09:09,158 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:09,177 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 13 treesize of output 6 [2018-12-31 04:09:09,177 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,189 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,201 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,247 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 68 treesize of output 57 [2018-12-31 04:09:09,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:09,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-31 04:09:09,251 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-31 04:09:09,277 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,285 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,289 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 66 treesize of output 55 [2018-12-31 04:09:09,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-31 04:09:09,292 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:09,306 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 21 treesize of output 14 [2018-12-31 04:09:09,307 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,315 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,319 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 65 treesize of output 52 [2018-12-31 04:09:09,322 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 27 treesize of output 21 [2018-12-31 04:09:09,322 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:09,337 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 13 treesize of output 6 [2018-12-31 04:09:09,337 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,347 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 24 [2018-12-31 04:09:09,383 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 9 [2018-12-31 04:09:09,384 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,392 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 24 [2018-12-31 04:09:09,400 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 9 [2018-12-31 04:09:09,400 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,407 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:09,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-31 04:09:09,436 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 7 variables, input treesize:1902, output treesize:63 [2018-12-31 04:09:09,466 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 16 treesize of output 12 [2018-12-31 04:09:09,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-31 04:09:09,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:09,472 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 04:09:09,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-31 04:09:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:09,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:09:09,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 04:09:09,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:09:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:09:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:09:09,500 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 11 states. [2018-12-31 04:09:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:09:09,952 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-31 04:09:09,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:09:09,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-12-31 04:09:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:09:09,955 INFO L225 Difference]: With dead ends: 104 [2018-12-31 04:09:09,956 INFO L226 Difference]: Without dead ends: 102 [2018-12-31 04:09:09,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:09:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-31 04:09:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 61. [2018-12-31 04:09:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-31 04:09:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-31 04:09:09,976 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 30 [2018-12-31 04:09:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:09:09,976 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-31 04:09:09,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:09:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-31 04:09:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 04:09:09,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:09:09,981 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:09:09,981 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:09:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:09:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1353027366, now seen corresponding path program 1 times [2018-12-31 04:09:09,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:09:09,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:09:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:09:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:09:09,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:09:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:09:10,338 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-12-31 04:09:10,536 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-12-31 04:09:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:10,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:09:10,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:09:10,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:09:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:09:10,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:09:10,865 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 04:09:10,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-31 04:09:10,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:09:10,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:09:10,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-31 04:09:10,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-31 04:09:10,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:10,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-31 04:09:10,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:11,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:11,003 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 11 treesize of output 4 [2018-12-31 04:09:11,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:11,032 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 21 treesize of output 19 [2018-12-31 04:09:11,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:11,038 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 16 treesize of output 23 [2018-12-31 04:09:11,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:11,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:11,100 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 21 treesize of output 19 [2018-12-31 04:09:11,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:11,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-31 04:09:11,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:11,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:11,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:11,132 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:60, output treesize:36 [2018-12-31 04:09:12,109 WARN L181 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 63 [2018-12-31 04:09:12,110 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 04:09:12,130 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 04:09:12,223 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 1339 treesize of output 513 [2018-12-31 04:09:12,332 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2018-12-31 04:09:12,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 25 treesize of output 28 [2018-12-31 04:09:12,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,341 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 28 treesize of output 47 [2018-12-31 04:09:12,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,406 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 249 treesize of output 233 [2018-12-31 04:09:12,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,425 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 181 [2018-12-31 04:09:12,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 273 [2018-12-31 04:09:12,489 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,520 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,555 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,591 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 04:09:12,636 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 04:09:12,646 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 04:09:12,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 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 316 treesize of output 184 [2018-12-31 04:09:12,715 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 103 treesize of output 91 [2018-12-31 04:09:12,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,719 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 91 treesize of output 104 [2018-12-31 04:09:12,720 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,734 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:12,777 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 107 treesize of output 85 [2018-12-31 04:09:12,780 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 57 treesize of output 51 [2018-12-31 04:09:12,781 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:12,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:12,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 106 [2018-12-31 04:09:12,907 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-12-31 04:09:12,967 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-31 04:09:13,025 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 128 treesize of output 102 [2018-12-31 04:09:13,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,038 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 33 treesize of output 76 [2018-12-31 04:09:13,038 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:13,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 86 [2018-12-31 04:09:13,069 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 04:09:13,085 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:13,089 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 130 treesize of output 104 [2018-12-31 04:09:13,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,113 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 33 treesize of output 76 [2018-12-31 04:09:13,114 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:13,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 88 [2018-12-31 04:09:13,145 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:13,163 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 04:09:13,168 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 139 treesize of output 109 [2018-12-31 04:09:13,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 64 [2018-12-31 04:09:13,183 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 04:09:13,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:13,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 79 [2018-12-31 04:09:13,238 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-31 04:09:13,291 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 04:09:14,113 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-31 04:09:14,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-31 04:09:14,734 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 4 variables, input treesize:2004, output treesize:353 [2018-12-31 04:09:15,153 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 93 treesize of output 70 [2018-12-31 04:09:15,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-12-31 04:09:15,162 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 04:09:15,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:15,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:15,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:15,497 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-12-31 04:09:15,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-31 04:09:15,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:15,721 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 04:09:16,157 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 33 treesize of output 27 [2018-12-31 04:09:16,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-31 04:09:16,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:16,316 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 15 treesize of output 8 [2018-12-31 04:09:16,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,707 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 91 treesize of output 85 [2018-12-31 04:09:16,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:16,713 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 13 treesize of output 6 [2018-12-31 04:09:16,713 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,732 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 04:09:16,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,766 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 60 treesize of output 41 [2018-12-31 04:09:16,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-31 04:09:16,773 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:16,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:16,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 04:09:16,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-31 04:09:16,800 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,810 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:09:16,818 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:185, output treesize:3 [2018-12-31 04:09:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:09:16,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:09:16,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-12-31 04:09:16,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 04:09:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 04:09:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:09:16,913 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 19 states. [2018-12-31 04:09:18,039 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-12-31 04:09:18,387 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 136 [2018-12-31 04:09:18,889 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 178 [2018-12-31 04:09:19,376 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 140 [2018-12-31 04:09:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:09:19,423 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-12-31 04:09:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:09:19,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-31 04:09:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:09:19,425 INFO L225 Difference]: With dead ends: 74 [2018-12-31 04:09:19,425 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:09:19,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2018-12-31 04:09:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:09:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:09:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:09:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:09:19,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-12-31 04:09:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:09:19,427 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:09:19,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 04:09:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:09:19,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:09:19,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:09:19,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,590 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 227 [2018-12-31 04:09:19,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,725 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 483 DAG size of output: 364 [2018-12-31 04:09:19,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:19,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:09:20,786 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 226 DAG size of output: 15 [2018-12-31 04:09:20,944 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-12-31 04:09:23,756 WARN L181 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 362 DAG size of output: 18 [2018-12-31 04:09:24,116 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 19 [2018-12-31 04:09:24,119 INFO L448 ceAbstractionStarter]: For program point L564-1(line 564) no Hoare annotation was computed. [2018-12-31 04:09:24,119 INFO L444 ceAbstractionStarter]: At program point L564-2(line 564) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_create_tree_~nodelast~0.base)) (not (= 0 ULTIMATE.start_inspect_~node.base)) (not (= 0 ULTIMATE.start_main_~data~0.base)) (not (= 0 |ULTIMATE.start_create_tree_#res.base|)) (= 0 ULTIMATE.start_create_tree_~node~0.offset) (= ULTIMATE.start_create_tree_~node~0.base 0)) [2018-12-31 04:09:24,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2018-12-31 04:09:24,119 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 615) no Hoare annotation was computed. [2018-12-31 04:09:24,119 INFO L448 ceAbstractionStarter]: For program point L614-2(lines 614 615) no Hoare annotation was computed. [2018-12-31 04:09:24,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:09:24,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L451 ceAbstractionStarter]: At program point L606-2(lines 606 610) the Hoare annotation is: true [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 563 571) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 583) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 582 583) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 608) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 567) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 625) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L567-1(line 567) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L448 ceAbstractionStarter]: For program point L567-2(line 567) no Hoare annotation was computed. [2018-12-31 04:09:24,120 INFO L444 ceAbstractionStarter]: At program point L567-3(line 567) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_create_tree_~nodelast~0.base)) (not (= 0 ULTIMATE.start_main_~data~0.base)) (not (= 0 |ULTIMATE.start_create_tree_#res.base|)) (= ULTIMATE.start_create_tree_~node~0.offset 0) (= ULTIMATE.start_create_tree_~node~0.base 0)) [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 573 603) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L592-2(lines 592 601) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 576 589) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L444 ceAbstractionStarter]: At program point L576-3(lines 576 589) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_create_tree_~node~0.offset 0))) (or (and (= ULTIMATE.start_create_tree_~nodelast~0.offset 0) (= ULTIMATE.start_create_tree_~nodelast~0.base 0) .cse0 (= ULTIMATE.start_create_tree_~node~0.base 0)) (and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_create_tree_~node~0.base) ULTIMATE.start_create_tree_~node~0.offset) 0) (= ULTIMATE.start_create_tree_~node~0.base ULTIMATE.start_create_tree_~nodelast~0.base) (and (not (= (select (select |#memory_int| ULTIMATE.start_create_tree_~node~0.base) (+ ULTIMATE.start_create_tree_~node~0.offset 12)) 0)) (not (= ULTIMATE.start_create_tree_~value~0 0)) (= ULTIMATE.start_create_tree_~node~0.offset ULTIMATE.start_create_tree_~nodelast~0.offset)) (= (select |#valid| ULTIMATE.start_create_tree_~node~0.base) 1) .cse0))) [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L576-4(lines 573 603) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L568-1(line 568) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L568-2(lines 565 570) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L568-3(line 568) no Hoare annotation was computed. [2018-12-31 04:09:24,121 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L444 ceAbstractionStarter]: At program point L602(lines 572 603) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_create_tree_~nodelast~0.base)) (.cse1 (= 0 |ULTIMATE.start_create_tree_#res.base|)) (.cse2 (= ULTIMATE.start_create_tree_~node~0.base 0))) (or (and (= 0 ULTIMATE.start_create_tree_~nodelast~0.offset) .cse0 (= 0 |ULTIMATE.start_create_tree_#res.offset|) (= ULTIMATE.start_create_tree_~node~0.offset 0) .cse1 .cse2) (and (not .cse0) (not .cse1) (= 0 ULTIMATE.start_create_tree_~node~0.offset) .cse2))) [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 595) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L594-2(lines 594 595) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 579) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L611-1(lines 604 620) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 618) no Hoare annotation was computed. [2018-12-31 04:09:24,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L578-2(lines 578 579) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L451 ceAbstractionStarter]: At program point L628(lines 621 629) the Hoare annotation is: true [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L554-1(line 554) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L554-2(line 554) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 613) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L612-2(lines 612 613) no Hoare annotation was computed. [2018-12-31 04:09:24,123 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 620) no Hoare annotation was computed. [2018-12-31 04:09:24,147 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:09:24,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:09:24,149 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:09:24,149 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:09:24,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:09:24,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:09:24,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:09:24 BoogieIcfgContainer [2018-12-31 04:09:24,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:09:24,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:09:24,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:09:24,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:09:24,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:08:30" (3/4) ... [2018-12-31 04:09:24,167 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:09:24,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 04:09:24,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 04:09:24,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 04:09:24,207 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == nodelast && 0 == nodelast) && 0 == \result) && node == 0) && 0 == \result) && node == 0) || (((!(0 == nodelast) && !(0 == \result)) && 0 == node) && node == 0) [2018-12-31 04:09:24,207 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(0 == nodelast) && !(0 == node)) && !(0 == data)) && !(0 == \result)) && 0 == node) && node == 0 [2018-12-31 04:09:24,224 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:09:24,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:09:24,226 INFO L168 Benchmark]: Toolchain (without parser) took 55940.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.4 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -335.9 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:09:24,226 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:09:24,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:09:24,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.93 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 04:09:24,229 INFO L168 Benchmark]: Boogie Preprocessor took 64.50 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:09:24,229 INFO L168 Benchmark]: RCFGBuilder took 838.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:09:24,229 INFO L168 Benchmark]: TraceAbstraction took 54108.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -230.6 MB). Peak memory consumption was 498.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:09:24,229 INFO L168 Benchmark]: Witness Printer took 65.95 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: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:09:24,234 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 769.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.93 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 64.50 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 838.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 54108.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -230.6 MB). Peak memory consumption was 498.4 MB. Max. memory is 11.5 GB. * Witness Printer took 65.95 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: 12.8 MB). Peak memory consumption was 12.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 554]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 554]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: (((!(0 == nodelast) && !(0 == data)) && !(0 == \result)) && node == 0) && node == 0 - InvariantResult [Line: 576]: Loop Invariant [2018-12-31 04:09:24,242 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:09:24,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:09:24,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-31 04:09:24,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-31 04:09:24,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-31 04:09:24,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((nodelast == 0 && nodelast == 0) && node == 0) && node == 0) || ((((#memory_$Pointer$[node][node] == 0 && node == nodelast) && (!(unknown-#memory_int-unknown[node][node + 12] == 0) && !(value == 0)) && node == nodelast) && \valid[node] == 1) && node == 0) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((!(0 == nodelast) && !(0 == node)) && !(0 == data)) && !(0 == \result)) && 0 == node) && node == 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((0 == nodelast && 0 == nodelast) && 0 == \result) && node == 0) && 0 == \result) && node == 0) || (((!(0 == nodelast) && !(0 == \result)) && 0 == node) && node == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 3 error locations. SAFE Result, 54.0s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 324 SDtfs, 825 SDslu, 1301 SDs, 0 SdLazy, 1231 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 158 SyntacticMatches, 35 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=9, 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, 11 MinimizatonAttempts, 166 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 18 NumberOfFragments, 130 HoareAnnotationTreeSize, 6 FomulaSimplifications, 97853 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4923 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 433 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 416 ConstructedInterpolants, 31 QuantifiedInterpolants, 356735 SizeOfPredicates, 88 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 35/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...