./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/list-properties/list_search-1.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 8b9ae191666cff52a5646f600ca779e3fb8cdedc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-30f4e4a [2019-11-27 23:52:27,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:52:27,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:52:27,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:52:27,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:52:27,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:52:27,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:52:27,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:52:27,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:52:27,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:52:27,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:52:27,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:52:27,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:52:27,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:52:27,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:52:27,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:52:27,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:52:27,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:52:27,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:52:27,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:52:27,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:52:27,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:52:27,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:52:27,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:52:27,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:52:27,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:52:27,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:52:27,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:52:27,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:52:27,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:52:27,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:52:27,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:52:27,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:52:27,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:52:27,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:52:27,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:52:27,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:52:27,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:52:27,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:52:27,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:52:27,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:52:27,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:52:27,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:52:27,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:52:27,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:52:27,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:52:27,411 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:52:27,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:52:27,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:52:27,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:52:27,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:52:27,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:52:27,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:52:27,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:52:27,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:52:27,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:52:27,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:52:27,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:52:27,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:52:27,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:52:27,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:52:27,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:52:27,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:52:27,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:52:27,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:52:27,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:52:27,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:52:27,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:52:27,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:52:27,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:52:27,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc [2019-11-27 23:52:27,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:52:27,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:52:27,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:52:27,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:52:27,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:52:27,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-27 23:52:27,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69b21c93/2b33dbee71f34a72a327b2f253715e57/FLAGb840eedb8 [2019-11-27 23:52:28,471 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:52:28,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-27 23:52:28,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69b21c93/2b33dbee71f34a72a327b2f253715e57/FLAGb840eedb8 [2019-11-27 23:52:28,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69b21c93/2b33dbee71f34a72a327b2f253715e57 [2019-11-27 23:52:28,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:52:28,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:52:28,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:52:28,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:52:28,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:52:28,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:52:28" (1/1) ... [2019-11-27 23:52:28,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cffb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:28, skipping insertion in model container [2019-11-27 23:52:28,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:52:28" (1/1) ... [2019-11-27 23:52:28,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:52:28,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:52:29,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:52:29,283 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:52:29,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:52:29,400 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:52:29,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29 WrapperNode [2019-11-27 23:52:29,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:52:29,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:52:29,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:52:29,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:52:29,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:52:29,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:52:29,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:52:29,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:52:29,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... [2019-11-27 23:52:29,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:52:29,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:52:29,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:52:29,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:52:29,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:52:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:52:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:52:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:52:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:52:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:52:29,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:52:29,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:52:29,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:52:30,002 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:52:30,002 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:52:30,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:30 BoogieIcfgContainer [2019-11-27 23:52:30,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:52:30,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:52:30,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:52:30,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:52:30,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:52:28" (1/3) ... [2019-11-27 23:52:30,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2c0ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:52:30, skipping insertion in model container [2019-11-27 23:52:30,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:29" (2/3) ... [2019-11-27 23:52:30,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2c0ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:52:30, skipping insertion in model container [2019-11-27 23:52:30,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:30" (3/3) ... [2019-11-27 23:52:30,013 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-27 23:52:30,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:52:30,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:52:30,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:52:30,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:52:30,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:52:30,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:52:30,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:52:30,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:52:30,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:52:30,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:52:30,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:52:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-27 23:52:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:52:30,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:30,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:30,092 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -332178203, now seen corresponding path program 1 times [2019-11-27 23:52:30,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:30,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286323257] [2019-11-27 23:52:30,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:30,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286323257] [2019-11-27 23:52:30,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:30,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:52:30,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539208289] [2019-11-27 23:52:30,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:52:30,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:52:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:52:30,462 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2019-11-27 23:52:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:30,587 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2019-11-27 23:52:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:52:30,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-27 23:52:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:30,602 INFO L225 Difference]: With dead ends: 49 [2019-11-27 23:52:30,603 INFO L226 Difference]: Without dead ends: 22 [2019-11-27 23:52:30,608 INFO L630 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-11-27 23:52:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-27 23:52:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-27 23:52:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:52:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-27 23:52:30,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-11-27 23:52:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:30,653 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-27 23:52:30,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:52:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-27 23:52:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:52:30,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:30,656 INFO L410 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-11-27 23:52:30,657 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983588, now seen corresponding path program 1 times [2019-11-27 23:52:30,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:30,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198444049] [2019-11-27 23:52:30,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:30,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198444049] [2019-11-27 23:52:30,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:30,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:52:30,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127270935] [2019-11-27 23:52:30,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:52:30,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:52:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:52:30,846 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-11-27 23:52:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:31,033 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-27 23:52:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:52:31,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-27 23:52:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:31,035 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:52:31,036 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:52:31,037 INFO L630 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-11-27 23:52:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:52:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-27 23:52:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-27 23:52:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-27 23:52:31,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-11-27 23:52:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:31,045 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-27 23:52:31,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:52:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-27 23:52:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:52:31,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:31,047 INFO L410 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-11-27 23:52:31,047 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1379241890, now seen corresponding path program 1 times [2019-11-27 23:52:31,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:31,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746551704] [2019-11-27 23:52:31,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:31,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746551704] [2019-11-27 23:52:31,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:31,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 23:52:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150256150] [2019-11-27 23:52:31,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:52:31,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:52:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:52:31,249 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-11-27 23:52:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:31,439 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-27 23:52:31,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:52:31,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-27 23:52:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:31,441 INFO L225 Difference]: With dead ends: 30 [2019-11-27 23:52:31,441 INFO L226 Difference]: Without dead ends: 25 [2019-11-27 23:52:31,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:52:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-27 23:52:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-27 23:52:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:52:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-27 23:52:31,449 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-11-27 23:52:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:31,449 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-27 23:52:31,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:52:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-27 23:52:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:52:31,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:31,451 INFO L410 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-11-27 23:52:31,451 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash -633881513, now seen corresponding path program 1 times [2019-11-27 23:52:31,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:31,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001037242] [2019-11-27 23:52:31,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:31,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001037242] [2019-11-27 23:52:31,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064998835] [2019-11-27 23:52:31,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:31,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 23:52:31,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:31,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:31,918 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,927 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,928 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-27 23:52:31,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-27 23:52:31,973 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,977 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,978 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-27 23:52:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:31,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:31,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-27 23:52:31,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072580691] [2019-11-27 23:52:31,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:52:31,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:52:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:52:31,991 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 14 states. [2019-11-27 23:52:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:32,464 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-27 23:52:32,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:52:32,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-27 23:52:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:32,467 INFO L225 Difference]: With dead ends: 45 [2019-11-27 23:52:32,467 INFO L226 Difference]: Without dead ends: 37 [2019-11-27 23:52:32,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-11-27 23:52:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-27 23:52:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-27 23:52:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:52:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-27 23:52:32,481 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-11-27 23:52:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:32,481 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-27 23:52:32,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:52:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-27 23:52:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:52:32,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:32,482 INFO L410 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-11-27 23:52:32,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:32,688 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:32,688 INFO L82 PathProgramCache]: Analyzing trace with hash -691139815, now seen corresponding path program 1 times [2019-11-27 23:52:32,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:32,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997173589] [2019-11-27 23:52:32,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:33,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997173589] [2019-11-27 23:52:33,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509746377] [2019-11-27 23:52:33,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:33,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-27 23:52:33,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:33,160 INFO L377 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-11-27 23:52:33,161 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,168 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,168 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:52:33,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:33,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 7 [2019-11-27 23:52:33,207 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,216 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,217 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2019-11-27 23:52:33,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,339 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:33,339 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,351 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,361 INFO L377 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 19 treesize of output 18 [2019-11-27 23:52:33,362 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,371 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,372 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2019-11-27 23:52:33,415 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_35|], 10=[|v_#memory_int_33|]} [2019-11-27 23:52:33,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:33,433 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,451 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:33,458 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,477 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:33,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-27 23:52:33,487 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,496 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,498 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,498 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:36 [2019-11-27 23:52:33,619 INFO L377 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 27 treesize of output 15 [2019-11-27 23:52:33,620 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,628 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:52:33,632 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,640 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,641 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2019-11-27 23:52:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:33,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:33,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-27 23:52:33,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682437423] [2019-11-27 23:52:33,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-27 23:52:33,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-27 23:52:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:52:33,710 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 22 states. [2019-11-27 23:52:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:34,328 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-27 23:52:34,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:52:34,329 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-11-27 23:52:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:34,330 INFO L225 Difference]: With dead ends: 33 [2019-11-27 23:52:34,330 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 23:52:34,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:52:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 23:52:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-27 23:52:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:52:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-27 23:52:34,337 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-11-27 23:52:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:34,337 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-27 23:52:34,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-27 23:52:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-27 23:52:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:52:34,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:34,338 INFO L410 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-11-27 23:52:34,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:34,543 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1263868996, now seen corresponding path program 2 times [2019-11-27 23:52:34,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:34,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182019309] [2019-11-27 23:52:34,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:34,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182019309] [2019-11-27 23:52:34,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698710884] [2019-11-27 23:52:34,936 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:35,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:52:35,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:52:35,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-27 23:52:35,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:35,116 INFO L377 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-11-27 23:52:35,117 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,123 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,124 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:52:35,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:35,134 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,140 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,141 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-27 23:52:35,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,177 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:35,178 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,193 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,198 INFO L377 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 24 treesize of output 12 [2019-11-27 23:52:35,199 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,208 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,208 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-11-27 23:52:35,215 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.base_40|]} [2019-11-27 23:52:35,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:35,222 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,238 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,245 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:35,258 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:35,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-11-27 23:52:35,267 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,278 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,279 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,280 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-27 23:52:35,365 INFO L377 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 7 [2019-11-27 23:52:35,365 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,373 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,374 INFO L508 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-11-27 23:52:35,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-11-27 23:52:35,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2019-11-27 23:52:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,441 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,443 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,443 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2019-11-27 23:52:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:35,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:35,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2019-11-27 23:52:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764000574] [2019-11-27 23:52:35,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 23:52:35,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 23:52:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:52:35,451 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-11-27 23:52:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:36,442 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-27 23:52:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 23:52:36,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-27 23:52:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:36,449 INFO L225 Difference]: With dead ends: 51 [2019-11-27 23:52:36,449 INFO L226 Difference]: Without dead ends: 43 [2019-11-27 23:52:36,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:52:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-27 23:52:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-27 23:52:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:52:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-27 23:52:36,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-11-27 23:52:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:36,459 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-27 23:52:36,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 23:52:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-27 23:52:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:52:36,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:36,460 INFO L410 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-11-27 23:52:36,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:36,672 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1321127298, now seen corresponding path program 2 times [2019-11-27 23:52:36,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:36,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207265825] [2019-11-27 23:52:36,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:37,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207265825] [2019-11-27 23:52:37,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290661893] [2019-11-27 23:52:37,337 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:37,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:52:37,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:52:37,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-27 23:52:37,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:37,498 INFO L377 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-11-27 23:52:37,498 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,513 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,513 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-27 23:52:37,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:37,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 7 [2019-11-27 23:52:37,561 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,573 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,573 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-11-27 23:52:37,663 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:52:37,665 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,696 INFO L588 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-27 23:52:37,701 INFO L377 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 19 treesize of output 18 [2019-11-27 23:52:37,702 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,716 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,716 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2019-11-27 23:52:37,764 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_41|], 10=[|v_#memory_int_36|]} [2019-11-27 23:52:37,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:37,769 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,790 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:37,801 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,818 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:37,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-27 23:52:37,828 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,844 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,845 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,845 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:77, output treesize:52 [2019-11-27 23:52:37,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-27 23:52:37,948 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:37,976 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:37,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-27 23:52:37,984 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,013 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-27 23:52:38,018 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,043 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,053 INFO L377 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 49 treesize of output 25 [2019-11-27 23:52:38,054 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,070 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,071 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,071 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:60 [2019-11-27 23:52:38,128 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_44|], 10=[|v_#memory_int_38|]} [2019-11-27 23:52:38,131 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:38,171 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,182 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:38,209 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:38,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-27 23:52:38,224 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,252 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:38,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-27 23:52:38,260 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,316 INFO L588 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-27 23:52:38,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:38,323 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-27 23:52:38,324 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,343 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,344 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,344 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:124, output treesize:77 [2019-11-27 23:52:38,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:52:38,580 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-27 23:52:38,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 53 [2019-11-27 23:52:38,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:38,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:38,584 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:38,619 INFO L588 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-27 23:52:38,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-11-27 23:52:38,634 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,644 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:38,645 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,645 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-11-27 23:52:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:38,683 INFO L404 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[v_prenex_1]} [2019-11-27 23:52:38,686 INFO L377 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 3 [2019-11-27 23:52:38,687 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,703 INFO L588 ElimStorePlain]: treesize reduction 21, result has 19.2 percent of original size [2019-11-27 23:52:38,703 INFO L476 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-11-27 23:52:38,704 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:38,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-11-27 23:52:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:38,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:38,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-11-27 23:52:38,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727251834] [2019-11-27 23:52:38,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-27 23:52:38,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-27 23:52:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:52:38,737 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-27 23:52:39,539 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-27 23:52:39,706 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-27 23:52:39,973 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2019-11-27 23:52:40,281 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-11-27 23:52:40,520 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2019-11-27 23:52:40,768 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2019-11-27 23:52:40,965 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-27 23:52:41,197 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-11-27 23:52:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:41,264 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-27 23:52:41,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 23:52:41,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 27 [2019-11-27 23:52:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:41,266 INFO L225 Difference]: With dead ends: 36 [2019-11-27 23:52:41,267 INFO L226 Difference]: Without dead ends: 31 [2019-11-27 23:52:41,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 23:52:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-27 23:52:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-27 23:52:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:52:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-27 23:52:41,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-11-27 23:52:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:41,276 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-27 23:52:41,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-27 23:52:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-27 23:52:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 23:52:41,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:41,278 INFO L410 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-11-27 23:52:41,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:41,488 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash -213891529, now seen corresponding path program 3 times [2019-11-27 23:52:41,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:41,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203687441] [2019-11-27 23:52:41,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:42,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203687441] [2019-11-27 23:52:42,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406556780] [2019-11-27 23:52:42,324 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:42,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-27 23:52:42,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:52:42,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-27 23:52:42,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:43,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:43,037 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,043 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,044 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-27 23:52:43,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:43,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-27 23:52:43,100 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,109 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,110 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-27 23:52:43,140 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_41|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.base_49|]} [2019-11-27 23:52:43,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-27 23:52:43,145 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,169 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,172 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:43,186 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:43,194 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:52:43,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-11-27 23:52:43,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,210 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,239 INFO L588 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-27 23:52:43,240 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,241 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-27 23:52:43,333 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_50|]} [2019-11-27 23:52:43,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:43,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-27 23:52:43,340 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,353 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:43,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:52:43,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2019-11-27 23:52:43,365 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,384 INFO L588 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-11-27 23:52:43,384 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40 [2019-11-27 23:52:43,429 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.offset_42|], 5=[|v_#memory_$Pointer$.base_51|]} [2019-11-27 23:52:43,431 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:43,453 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-27 23:52:43,461 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,479 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:52:43,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,495 INFO L377 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 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-27 23:52:43,496 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:43,541 INFO L588 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-27 23:52:43,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:43,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:52:43,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:43,579 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2019-11-27 23:52:43,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,597 INFO L508 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:43,747 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-11-27 23:52:43,748 INFO L588 ElimStorePlain]: treesize reduction 122, result has 52.0 percent of original size [2019-11-27 23:52:43,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:43,750 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:43,751 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:194 [2019-11-27 23:52:43,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:44,054 INFO L343 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2019-11-27 23:52:44,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2019-11-27 23:52:44,055 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:44,065 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:44,066 INFO L508 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-11-27 23:52:44,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:51 [2019-11-27 23:52:44,129 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:44,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2019-11-27 23:52:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:44,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:44,140 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:44,140 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:44,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:4 [2019-11-27 23:52:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:44,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:44,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-27 23:52:44,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001140998] [2019-11-27 23:52:44,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-27 23:52:44,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-27 23:52:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-11-27 23:52:44,149 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 32 states. [2019-11-27 23:52:45,550 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-27 23:52:45,789 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-11-27 23:52:46,017 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-11-27 23:52:46,246 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-11-27 23:52:46,434 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-11-27 23:52:46,630 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-27 23:52:46,815 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-27 23:52:46,993 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-27 23:52:47,138 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-27 23:52:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:47,192 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-27 23:52:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-27 23:52:47,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-11-27 23:52:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:47,199 INFO L225 Difference]: With dead ends: 57 [2019-11-27 23:52:47,199 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:52:47,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=757, Invalid=2435, Unknown=0, NotChecked=0, Total=3192 [2019-11-27 23:52:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:52:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-27 23:52:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-27 23:52:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-27 23:52:47,209 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-11-27 23:52:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:47,209 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-27 23:52:47,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-27 23:52:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-27 23:52:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 23:52:47,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:47,211 INFO L410 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-11-27 23:52:47,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:47,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:47,422 INFO L82 PathProgramCache]: Analyzing trace with hash -271149831, now seen corresponding path program 3 times [2019-11-27 23:52:47,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:47,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14766229] [2019-11-27 23:52:47,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:52:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:52:47,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:52:47,510 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:52:47,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:52:47 BoogieIcfgContainer [2019-11-27 23:52:47,564 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:52:47,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:52:47,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:52:47,565 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:52:47,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:30" (3/4) ... [2019-11-27 23:52:47,568 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:52:47,628 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:52:47,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:52:47,630 INFO L168 Benchmark]: Toolchain (without parser) took 18852.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 961.7 MB in the beginning and 974.8 MB in the end (delta: -13.1 MB). Peak memory consumption was 366.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:47,631 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:47,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:47,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:47,632 INFO L168 Benchmark]: Boogie Preprocessor took 32.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:47,632 INFO L168 Benchmark]: RCFGBuilder took 511.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:47,633 INFO L168 Benchmark]: TraceAbstraction took 17558.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.1 GB in the beginning and 974.8 MB in the end (delta: 109.9 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:47,633 INFO L168 Benchmark]: Witness Printer took 64.52 ms. Allocated memory is still 1.4 GB. Free memory is still 974.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:47,635 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 511.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17558.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.6 MB). Free memory was 1.1 GB in the beginning and 974.8 MB in the end (delta: 109.9 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.52 ms. Allocated memory is still 1.4 GB. Free memory is still 974.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L522] mlist *head; VAL [head={0:0}] [L543] int i; [L544] mlist *mylist, *temp; [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={0:0}] [L533] COND TRUE head==((void *)0) [L534] l->next = ((void *)0) VAL [head={0:0}] [L539] head = l [L540] return 0; VAL [head={-4:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-4:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-4:0}] [L539] head = l [L540] return 0; VAL [head={-3:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-3:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-3:0}] [L539] head = l [L540] return 0; VAL [head={-2:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-2:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-2:0}] [L539] head = l [L540] return 0; VAL [head={-1:0}] [L524] l = head VAL [head={-1:0}] [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND FALSE !(l!=((void *)0) && l->key!=k) [L528] return l; VAL [head={-1:0}] [L549] temp = search_list(head,2) [L550] temp->key [L3] COND TRUE !(cond) VAL [head={-1:0}] [L4] __VERIFIER_error() VAL [head={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.4s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 916 SDslu, 295 SDs, 0 SdLazy, 1533 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 8.9s 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 DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 12 QuantifiedInterpolants, 112892 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1061 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...