./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.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 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:19:43,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:19:43,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:19:43,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:19:43,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:19:43,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:19:43,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:19:43,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:19:43,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:19:43,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:19:43,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:19:43,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:19:43,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:19:43,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:19:43,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:19:43,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:19:43,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:19:43,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:19:43,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:19:43,276 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:19:43,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:19:43,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:19:43,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:19:43,293 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:19:43,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:19:43,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:19:43,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:19:43,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:19:43,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:19:43,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:19:43,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:19:43,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:19:43,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:19:43,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:19:43,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:19:43,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:19:43,305 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:19:43,323 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:19:43,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:19:43,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:19:43,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:19:43,325 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:19:43,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:19:43,326 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:19:43,328 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:19:43,328 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:19:43,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:19:43,328 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:19:43,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:19:43,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:19:43,329 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:19:43,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:19:43,329 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:19:43,329 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:19:43,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:19:43,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:19:43,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:19:43,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:19:43,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:19:43,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:19:43,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:19:43,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:19:43,334 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:19:43,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:19:43,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:19:43,335 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2019-01-12 09:19:43,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:19:43,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:19:43,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:19:43,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:19:43,433 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:19:43,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:19:43,490 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e0f2b3/8339fe6ae8034a7f80c36f93716d30ca/FLAG423e2d5d0 [2019-01-12 09:19:43,964 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:19:43,966 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:19:43,977 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e0f2b3/8339fe6ae8034a7f80c36f93716d30ca/FLAG423e2d5d0 [2019-01-12 09:19:44,262 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e0f2b3/8339fe6ae8034a7f80c36f93716d30ca [2019-01-12 09:19:44,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:19:44,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:19:44,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:19:44,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:19:44,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:19:44,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@872c042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44, skipping insertion in model container [2019-01-12 09:19:44,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:19:44,341 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:19:44,684 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:19:44,696 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:19:44,832 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:19:44,897 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:19:44,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44 WrapperNode [2019-01-12 09:19:44,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:19:44,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:19:44,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:19:44,898 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:19:44,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:19:44,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:19:44,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:19:44,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:19:44,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:44,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... [2019-01-12 09:19:45,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:19:45,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:19:45,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:19:45,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:19:45,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:19:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:19:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:19:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:19:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:19:45,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:19:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:19:45,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:19:45,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:19:45,684 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:19:45,684 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:19:45,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:19:45 BoogieIcfgContainer [2019-01-12 09:19:45,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:19:45,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:19:45,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:19:45,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:19:45,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:19:44" (1/3) ... [2019-01-12 09:19:45,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce50169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:19:45, skipping insertion in model container [2019-01-12 09:19:45,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:19:44" (2/3) ... [2019-01-12 09:19:45,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce50169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:19:45, skipping insertion in model container [2019-01-12 09:19:45,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:19:45" (3/3) ... [2019-01-12 09:19:45,693 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:19:45,703 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:19:45,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:19:45,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:19:45,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:19:45,757 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:19:45,757 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:19:45,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:19:45,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:19:45,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:19:45,758 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:19:45,758 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:19:45,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:19:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-12 09:19:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:19:45,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:45,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:19:45,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -332178203, now seen corresponding path program 1 times [2019-01-12 09:19:45,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:45,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:45,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:45,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:46,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:19:46,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:19:46,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:19:46,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:19:46,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:19:46,090 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2019-01-12 09:19:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:46,289 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2019-01-12 09:19:46,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:19:46,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-12 09:19:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:46,299 INFO L225 Difference]: With dead ends: 49 [2019-01-12 09:19:46,299 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 09:19:46,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:19:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 09:19:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 09:19:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 09:19:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-12 09:19:46,337 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-01-12 09:19:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:46,338 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-12 09:19:46,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:19:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-12 09:19:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:19:46,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:46,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:19:46,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:46,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983588, now seen corresponding path program 1 times [2019-01-12 09:19:46,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:46,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:46,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:46,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:19:46,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:19:46,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:19:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:19:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:19:46,532 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-01-12 09:19:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:46,802 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-12 09:19:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:19:46,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-12 09:19:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:46,805 INFO L225 Difference]: With dead ends: 38 [2019-01-12 09:19:46,805 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 09:19:46,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:19:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 09:19:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-12 09:19:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 09:19:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-12 09:19:46,812 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-01-12 09:19:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:46,813 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-12 09:19:46,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:19:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-12 09:19:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:19:46,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:46,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:19:46,814 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1379241890, now seen corresponding path program 1 times [2019-01-12 09:19:46,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:46,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:46,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:46,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:46,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:47,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:19:47,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:19:47,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:19:47,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:19:47,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:19:47,079 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-01-12 09:19:47,513 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-12 09:19:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:47,654 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-12 09:19:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:19:47,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:19:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:47,657 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:19:47,657 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:19:47,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:19:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:19:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:19:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:19:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-12 09:19:47,664 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-01-12 09:19:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:47,665 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-12 09:19:47,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:19:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-12 09:19:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:19:47,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:47,666 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] [2019-01-12 09:19:47,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -633881513, now seen corresponding path program 1 times [2019-01-12 09:19:47,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:47,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:48,146 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-01-12 09:19:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:48,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:19:48,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:19:48,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:48,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:19:48,454 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 [2019-01-12 09:19:48,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, 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 [2019-01-12 09:19:48,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:48,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:48,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:48,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-12 09:19:48,527 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 18 treesize of output 14 [2019-01-12 09:19:48,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:19:48,537 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 14 treesize of output 10 [2019-01-12 09:19:48,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:48,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:48,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:48,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2019-01-12 09:19:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:48,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:19:48,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-12 09:19:48,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:19:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:19:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:19:48,581 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2019-01-12 09:19:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:49,299 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-12 09:19:49,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:19:49,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-01-12 09:19:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:49,301 INFO L225 Difference]: With dead ends: 45 [2019-01-12 09:19:49,302 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 09:19:49,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:19:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 09:19:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-01-12 09:19:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:19:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-12 09:19:49,309 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-01-12 09:19:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:49,310 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-12 09:19:49,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:19:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-12 09:19:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:19:49,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:49,311 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:19:49,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -691139815, now seen corresponding path program 1 times [2019-01-12 09:19:49,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:49,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:49,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:49,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:49,847 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-01-12 09:19:50,140 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-12 09:19:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:50,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:19:50,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:19:50,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:50,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:19:50,432 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 22 treesize of output 19 [2019-01-12 09:19:50,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-12 09:19:50,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:50,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-12 09:19:50,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-01-12 09:19:50,569 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2019-01-12 09:19:50,574 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 19 [2019-01-12 09:19:50,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-01-12 09:19:50,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:19:50,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:19:50,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:25, output treesize:39 [2019-01-12 09:19:50,814 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 63 treesize of output 60 [2019-01-12 09:19:50,817 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 [2019-01-12 09:19:50,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,889 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 56 treesize of output 53 [2019-01-12 09:19:50,892 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 [2019-01-12 09:19:50,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,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, 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 [2019-01-12 09:19:50,953 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-12 09:19:50,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-12 09:19:50,961 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,962 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:50,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,061 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 87 [2019-01-12 09:19:51,067 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2019-01-12 09:19:51,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-12 09:19:51,071 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,093 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,182 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,209 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 26 treesize of output 23 [2019-01-12 09:19:51,214 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 [2019-01-12 09:19:51,214 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,221 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,226 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 39 treesize of output 36 [2019-01-12 09:19:51,229 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 [2019-01-12 09:19:51,230 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,286 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:19:51,420 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:120, output treesize:49 [2019-01-12 09:19:51,628 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 37 treesize of output 33 [2019-01-12 09:19:51,635 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 [2019-01-12 09:19:51,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,666 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 26 treesize of output 22 [2019-01-12 09:19:51,677 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 [2019-01-12 09:19:51,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-01-12 09:19:51,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-12 09:19:51,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,719 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,737 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 30 treesize of output 26 [2019-01-12 09:19:51,740 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 [2019-01-12 09:19:51,741 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:51,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:19:51,761 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:79, output treesize:32 [2019-01-12 09:19:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:52,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:19:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-01-12 09:19:52,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 09:19:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 09:19:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-01-12 09:19:52,106 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 27 states. [2019-01-12 09:19:52,943 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-12 09:19:53,166 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-01-12 09:19:53,620 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-01-12 09:19:54,249 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-12 09:19:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:54,272 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-01-12 09:19:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 09:19:54,274 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 24 [2019-01-12 09:19:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:54,275 INFO L225 Difference]: With dead ends: 33 [2019-01-12 09:19:54,275 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 09:19:54,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 09:19:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 09:19:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-12 09:19:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:19:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-12 09:19:54,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-01-12 09:19:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:54,283 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-12 09:19:54,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 09:19:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-12 09:19:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:19:54,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:54,284 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:19:54,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1263868996, now seen corresponding path program 2 times [2019-01-12 09:19:54,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:54,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:54,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:19:54,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:54,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:19:54,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:19:54,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:19:55,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:19:55,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:19:55,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:19:55,130 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 [2019-01-12 09:19:55,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:19:55,154 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 [2019-01-12 09:19:55,160 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 [2019-01-12 09:19:55,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-12 09:19:55,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:55,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:55,216 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 [2019-01-12 09:19:55,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-12 09:19:55,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:19:55,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,275 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:21 [2019-01-12 09:19:55,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:55,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:55,319 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 13 treesize of output 10 [2019-01-12 09:19:55,322 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 [2019-01-12 09:19:55,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-12 09:19:55,349 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 [2019-01-12 09:19:55,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:55,370 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 [2019-01-12 09:19:55,370 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,384 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,408 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:59, output treesize:39 [2019-01-12 09:19:55,511 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 [2019-01-12 09:19:55,527 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 [2019-01-12 09:19:55,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:55,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:33 [2019-01-12 09:19:55,608 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 34 treesize of output 25 [2019-01-12 09:19:55,617 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:19:55,618 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 14 treesize of output 10 [2019-01-12 09:19:55,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-12 09:19:55,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:55,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:4 [2019-01-12 09:19:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:55,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:19:55,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2019-01-12 09:19:55,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 09:19:55,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 09:19:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:19:55,655 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 19 states. [2019-01-12 09:19:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:19:56,993 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-01-12 09:19:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 09:19:56,993 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-01-12 09:19:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:19:56,994 INFO L225 Difference]: With dead ends: 51 [2019-01-12 09:19:56,994 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 09:19:56,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-01-12 09:19:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 09:19:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-01-12 09:19:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 09:19:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-01-12 09:19:57,003 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-01-12 09:19:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:19:57,004 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-01-12 09:19:57,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 09:19:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-01-12 09:19:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:19:57,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:19:57,007 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:19:57,007 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:19:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:19:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1321127298, now seen corresponding path program 2 times [2019-01-12 09:19:57,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:19:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:19:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:57,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:19:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:19:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:19:57,375 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-12 09:19:57,651 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-01-12 09:19:58,229 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-01-12 09:19:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:19:58,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:19:58,447 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 [2019-01-12 09:19:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:19:58,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:19:58,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:19:58,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:19:58,569 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 [2019-01-12 09:19:58,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:19:58,701 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 22 treesize of output 19 [2019-01-12 09:19:58,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-12 09:19:58,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:58,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-12 09:19:58,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,720 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-01-12 09:19:58,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:58,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:58,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-12 09:19:58,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,814 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 19 treesize of output 20 [2019-01-12 09:19:58,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:19:58,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,880 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2019-01-12 09:19:58,926 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 13 treesize of output 10 [2019-01-12 09:19:58,935 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 [2019-01-12 09:19:58,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-12 09:19:58,970 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-12 09:19:58,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-12 09:19:58,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:58,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,004 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 13 treesize of output 10 [2019-01-12 09:19:59,007 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 [2019-01-12 09:19:59,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,009 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,022 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:77, output treesize:52 [2019-01-12 09:19:59,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:59,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:59,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-12 09:19:59,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 32 [2019-01-12 09:19:59,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:19:59,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-12 09:19:59,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:19:59,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2019-01-12 09:19:59,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:19:59,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,360 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:101, output treesize:60 [2019-01-12 09:19:59,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 41 [2019-01-12 09:19:59,431 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-12 09:19:59,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-12 09:19:59,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:59,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:59,518 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:59,521 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:19:59,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-12 09:19:59,554 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 [2019-01-12 09:19:59,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:59,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:19:59,566 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,574 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,584 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:59,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 59 [2019-01-12 09:19:59,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-12 09:19:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:19:59,740 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 27 treesize of output 31 [2019-01-12 09:19:59,740 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,750 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,764 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:19:59,788 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:124, output treesize:77 [2019-01-12 09:20:00,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:00,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:00,113 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 74 [2019-01-12 09:20:00,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:20:00,131 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2019-01-12 09:20:00,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-12 09:20:00,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-12 09:20:00,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:00,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:00,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-12 09:20:00,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2019-01-12 09:20:00,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,219 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 [2019-01-12 09:20:00,220 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,238 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-01-12 09:20:00,294 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-12 09:20:00,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,304 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 7 treesize of output 5 [2019-01-12 09:20:00,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:00,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-01-12 09:20:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:20:00,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:20:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-01-12 09:20:00,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 09:20:00,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 09:20:00,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-01-12 09:20:00,385 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 32 states. [2019-01-12 09:20:01,230 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-01-12 09:20:01,400 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-01-12 09:20:01,658 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 109 [2019-01-12 09:20:01,942 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 110 [2019-01-12 09:20:02,175 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-01-12 09:20:02,417 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2019-01-12 09:20:02,608 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-01-12 09:20:02,817 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-01-12 09:20:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:20:02,884 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-12 09:20:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 09:20:02,886 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 27 [2019-01-12 09:20:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:20:02,887 INFO L225 Difference]: With dead ends: 36 [2019-01-12 09:20:02,887 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 09:20:02,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=290, Invalid=1780, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 09:20:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 09:20:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-12 09:20:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:20:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-12 09:20:02,896 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-12 09:20:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:20:02,896 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-12 09:20:02,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 09:20:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-12 09:20:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:20:02,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:20:02,897 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:20:02,897 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:20:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:20:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -213891529, now seen corresponding path program 3 times [2019-01-12 09:20:02,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:20:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:20:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:20:02,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:20:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:20:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:20:03,230 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-12 09:20:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:20:03,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:20:03,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 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 [2019-01-12 09:20:03,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:20:04,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 09:20:04,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:20:04,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:20:04,062 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 [2019-01-12 09:20:04,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-12 09:20:04,080 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 [2019-01-12 09:20:04,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2019-01-12 09:20:04,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-12 09:20:04,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-12 09:20:04,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-12 09:20:04,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:20:04,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,159 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:31 [2019-01-12 09:20:04,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:04,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:04,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2019-01-12 09:20:04,237 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 [2019-01-12 09:20:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,241 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 [2019-01-12 09:20:04,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,287 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 13 treesize of output 10 [2019-01-12 09:20:04,291 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 [2019-01-12 09:20:04,292 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,294 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,311 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:69, output treesize:55 [2019-01-12 09:20:04,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-12 09:20:04,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2019-01-12 09:20:04,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:20:04,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2019-01-12 09:20:04,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:20:04,496 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,519 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:93, output treesize:56 [2019-01-12 09:20:04,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:04,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:04,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-12 09:20:04,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 09:20:04,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2019-01-12 09:20:04,755 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 28 treesize of output 27 [2019-01-12 09:20:04,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,761 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 27 treesize of output 31 [2019-01-12 09:20:04,762 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,770 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:04,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2019-01-12 09:20:04,814 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 [2019-01-12 09:20:04,814 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:04,855 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:101, output treesize:80 [2019-01-12 09:20:05,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:05,119 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 53 treesize of output 43 [2019-01-12 09:20:05,144 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:20:05,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:20:05,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,298 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 23 treesize of output 11 [2019-01-12 09:20:05,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:20:05,464 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2019-01-12 09:20:05,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:05,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:20:05,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2019-01-12 09:20:05,521 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2019-01-12 09:20:05,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,535 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 [2019-01-12 09:20:05,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,547 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:20:05,547 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 14 treesize of output 10 [2019-01-12 09:20:05,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:20:05,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:4 [2019-01-12 09:20:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:20:05,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:20:05,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2019-01-12 09:20:05,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 09:20:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 09:20:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2019-01-12 09:20:05,620 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 29 states. [2019-01-12 09:20:06,298 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-12 09:20:06,476 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-01-12 09:20:06,816 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-01-12 09:20:07,096 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-01-12 09:20:07,349 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-01-12 09:20:07,566 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2019-01-12 09:20:07,788 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-01-12 09:20:08,013 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-01-12 09:20:08,245 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-12 09:20:08,464 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-01-12 09:20:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:20:08,681 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-01-12 09:20:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 09:20:08,683 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-01-12 09:20:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:20:08,684 INFO L225 Difference]: With dead ends: 57 [2019-01-12 09:20:08,684 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 09:20:08,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 09:20:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 09:20:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-01-12 09:20:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 09:20:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-12 09:20:08,694 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-01-12 09:20:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:20:08,695 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-12 09:20:08,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 09:20:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-12 09:20:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:20:08,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:20:08,698 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:20:08,698 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:20:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:20:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash -271149831, now seen corresponding path program 3 times [2019-01-12 09:20:08,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:20:08,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:20:08,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:20:08,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:20:08,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:20:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:20:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:20:08,808 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:20:08,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:20:08 BoogieIcfgContainer [2019-01-12 09:20:08,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:20:08,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:20:08,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:20:08,885 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:20:08,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:19:45" (3/4) ... [2019-01-12 09:20:08,890 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:20:08,972 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:20:08,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:20:08,973 INFO L168 Benchmark]: Toolchain (without parser) took 24703.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.3 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -346.9 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:20:08,974 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:20:08,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:20:08,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:20:08,974 INFO L168 Benchmark]: Boogie Preprocessor took 46.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:20:08,976 INFO L168 Benchmark]: RCFGBuilder took 683.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:20:08,976 INFO L168 Benchmark]: TraceAbstraction took 23197.78 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -249.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:20:08,977 INFO L168 Benchmark]: Witness Printer took 87.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:20:08,981 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 625.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 683.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23197.78 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -249.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 87.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L623] mlist *head; VAL [head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [head={0:0}] [L634] COND TRUE head==((void *)0) [L635] l->next = ((void *)0) VAL [head={0:0}] [L640] head = l [L641] return 0; VAL [head={-1:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [head={-1:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [head={-1:0}] [L640] head = l [L641] return 0; VAL [head={-7:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [head={-7:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [head={-7:0}] [L640] head = l [L641] return 0; VAL [head={2:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [head={2:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [head={2:0}] [L640] head = l [L641] return 0; VAL [head={3:0}] [L625] l = head VAL [head={3:0}] [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [head={3:0}] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [head={3:0}] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [head={3:0}] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [head={3:0}] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] return l; VAL [head={3:0}] [L650] temp = search_list(head,2) [L651] temp->key [L4] COND TRUE !(cond) VAL [head={3:0}] [L5] __VERIFIER_error() VAL [head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. UNSAFE Result, 23.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 808 SDslu, 302 SDs, 0 SdLazy, 1655 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 110 SyntacticMatches, 21 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 17 QuantifiedInterpolants, 126950 SizeOfPredicates, 113 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...