./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-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-ext2-properties/list_and_tree_cnstr-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 eed6d14b3659ee573ecc9a025ea4a6cd48efa35c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:55:28,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:55:28,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:55:28,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:55:28,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:55:28,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:55:28,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:55:28,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:55:28,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:55:28,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:55:28,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:55:28,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:55:28,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:55:28,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:55:28,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:55:28,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:55:28,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:55:28,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:55:28,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:55:28,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:55:28,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:55:28,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:55:28,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:55:28,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:55:28,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:55:28,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:55:28,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:55:28,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:55:28,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:55:28,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:55:28,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:55:28,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:55:28,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:55:28,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:55:28,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:55:28,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:55:28,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:55:28,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:55:28,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:55:28,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:55:28,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:55:28,520 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:55:28,542 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:55:28,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:55:28,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:55:28,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:55:28,547 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:55:28,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:55:28,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:55:28,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:55:28,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:55:28,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:55:28,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:55:28,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:55:28,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:55:28,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:55:28,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:55:28,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:55:28,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:55:28,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:55:28,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:55:28,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:55:28,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:55:28,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:55:28,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:55:28,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:55:28,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:55:28,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:55:28,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:55:28,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:55:28,557 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 -> eed6d14b3659ee573ecc9a025ea4a6cd48efa35c [2019-11-27 23:55:28,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:55:28,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:55:28,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:55:28,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:55:28,869 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:55:28,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-27 23:55:28,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd71b80f/51811f223de444648ff006ceec34b99d/FLAG27416d806 [2019-11-27 23:55:29,414 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:55:29,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2019-11-27 23:55:29,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd71b80f/51811f223de444648ff006ceec34b99d/FLAG27416d806 [2019-11-27 23:55:29,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd71b80f/51811f223de444648ff006ceec34b99d [2019-11-27 23:55:29,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:55:29,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:55:29,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:55:29,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:55:29,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:55:29,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:55:29" (1/1) ... [2019-11-27 23:55:29,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c20c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:29, skipping insertion in model container [2019-11-27 23:55:29,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:55:29" (1/1) ... [2019-11-27 23:55:29,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:55:29,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:55:30,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:55:30,250 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:55:30,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:55:30,363 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:55:30,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30 WrapperNode [2019-11-27 23:55:30,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:55:30,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:55:30,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:55:30,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:55:30,376 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:55:30" (1/1) ... [2019-11-27 23:55:30,401 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:55:30" (1/1) ... [2019-11-27 23:55:30,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:55:30,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:55:30,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:55:30,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:55:30,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (1/1) ... [2019-11-27 23:55:30,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:55:30,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:55:30,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:55:30,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:55:30,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (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:55:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:55:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:55:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:55:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:55:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:55:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:55:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:55:30,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:55:31,068 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:55:31,069 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:55:31,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:31 BoogieIcfgContainer [2019-11-27 23:55:31,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:55:31,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:55:31,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:55:31,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:55:31,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:55:29" (1/3) ... [2019-11-27 23:55:31,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50174085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:55:31, skipping insertion in model container [2019-11-27 23:55:31,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:55:30" (2/3) ... [2019-11-27 23:55:31,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50174085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:55:31, skipping insertion in model container [2019-11-27 23:55:31,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:31" (3/3) ... [2019-11-27 23:55:31,084 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2019-11-27 23:55:31,092 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:55:31,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:55:31,109 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:55:31,133 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:55:31,133 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:55:31,133 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:55:31,134 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:55:31,134 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:55:31,134 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:55:31,134 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:55:31,135 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:55:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-27 23:55:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:55:31,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:31,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:31,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2019-11-27 23:55:31,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:31,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641012112] [2019-11-27 23:55:31,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:31,305 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:55:31,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641012112] [2019-11-27 23:55:31,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:31,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:55:31,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618311572] [2019-11-27 23:55:31,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:55:31,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:55:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:55:31,330 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-11-27 23:55:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:31,354 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-11-27 23:55:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:55:31,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 23:55:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:31,365 INFO L225 Difference]: With dead ends: 98 [2019-11-27 23:55:31,365 INFO L226 Difference]: Without dead ends: 43 [2019-11-27 23:55:31,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:55:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-27 23:55:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-27 23:55:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:55:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-11-27 23:55:31,406 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2019-11-27 23:55:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:31,406 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-11-27 23:55:31,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:55:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-11-27 23:55:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:55:31,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:31,408 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:55:31,408 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2019-11-27 23:55:31,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:31,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997315927] [2019-11-27 23:55:31,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:31,477 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:55:31,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997315927] [2019-11-27 23:55:31,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:31,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:31,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827123938] [2019-11-27 23:55:31,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:31,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:31,484 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-11-27 23:55:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:31,510 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-27 23:55:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:31,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 23:55:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:31,514 INFO L225 Difference]: With dead ends: 71 [2019-11-27 23:55:31,514 INFO L226 Difference]: Without dead ends: 51 [2019-11-27 23:55:31,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-27 23:55:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-27 23:55:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-27 23:55:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-27 23:55:31,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2019-11-27 23:55:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:31,524 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-27 23:55:31,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-27 23:55:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:55:31,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:31,526 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, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:31,526 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2019-11-27 23:55:31,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:31,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912186143] [2019-11-27 23:55:31,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:31,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912186143] [2019-11-27 23:55:31,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:31,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:55:31,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983888560] [2019-11-27 23:55:31,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:55:31,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:55:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:31,575 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2019-11-27 23:55:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:31,615 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-27 23:55:31,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:55:31,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 23:55:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:31,617 INFO L225 Difference]: With dead ends: 89 [2019-11-27 23:55:31,617 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 23:55:31,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:55:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 23:55:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-27 23:55:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-27 23:55:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2019-11-27 23:55:31,626 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2019-11-27 23:55:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:31,626 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2019-11-27 23:55:31,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:55:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2019-11-27 23:55:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:55:31,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:31,628 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, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:31,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2019-11-27 23:55:31,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:31,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350479008] [2019-11-27 23:55:31,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:31,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350479008] [2019-11-27 23:55:31,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:31,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:55:31,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419412291] [2019-11-27 23:55:31,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:55:31,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:55:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:31,745 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2019-11-27 23:55:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:31,906 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-11-27 23:55:31,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:55:31,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-27 23:55:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:31,908 INFO L225 Difference]: With dead ends: 78 [2019-11-27 23:55:31,908 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:55:31,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:55:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:55:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-11-27 23:55:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-27 23:55:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2019-11-27 23:55:31,917 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2019-11-27 23:55:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:31,917 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2019-11-27 23:55:31,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:55:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2019-11-27 23:55:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:55:31,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:31,919 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, 1, 1, 1, 1, 1] [2019-11-27 23:55:31,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2019-11-27 23:55:31,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:31,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376513163] [2019-11-27 23:55:31,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376513163] [2019-11-27 23:55:32,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:32,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:55:32,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079135913] [2019-11-27 23:55:32,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:55:32,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:55:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:32,031 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2019-11-27 23:55:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:32,176 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-27 23:55:32,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:55:32,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-27 23:55:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:32,179 INFO L225 Difference]: With dead ends: 80 [2019-11-27 23:55:32,179 INFO L226 Difference]: Without dead ends: 72 [2019-11-27 23:55:32,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:55:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-27 23:55:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2019-11-27 23:55:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-27 23:55:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2019-11-27 23:55:32,198 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2019-11-27 23:55:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:32,200 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2019-11-27 23:55:32,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:55:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2019-11-27 23:55:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:55:32,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:32,204 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, 1, 1, 1, 1, 1] [2019-11-27 23:55:32,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2019-11-27 23:55:32,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:32,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169887005] [2019-11-27 23:55:32,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:32,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169887005] [2019-11-27 23:55:32,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:55:32,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:55:32,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026482267] [2019-11-27 23:55:32,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:55:32,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:32,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:55:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:55:32,297 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2019-11-27 23:55:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:32,418 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-27 23:55:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:55:32,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-27 23:55:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:32,420 INFO L225 Difference]: With dead ends: 80 [2019-11-27 23:55:32,420 INFO L226 Difference]: Without dead ends: 69 [2019-11-27 23:55:32,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:55:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-27 23:55:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2019-11-27 23:55:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-27 23:55:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-27 23:55:32,427 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2019-11-27 23:55:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:32,427 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-27 23:55:32,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:55:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-27 23:55:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:55:32,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:32,429 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:32,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2019-11-27 23:55:32,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:32,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975975433] [2019-11-27 23:55:32,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:32,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975975433] [2019-11-27 23:55:32,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226337981] [2019-11-27 23:55:32,593 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:55:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:32,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 23:55:32,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:32,734 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:55:32,735 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,738 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,739 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:55:32,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,769 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:55:32,770 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,779 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,785 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 11 treesize of output 7 [2019-11-27 23:55:32,785 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,794 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,794 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:55:32,795 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-27 23:55:32,815 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:32,816 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 27 treesize of output 11 [2019-11-27 23:55:32,816 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,822 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,822 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-27 23:55:32,845 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:55:32,846 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,854 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,855 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:32,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-27 23:55:32,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-27 23:55:32,892 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,896 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:32,897 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:32,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-27 23:55:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:32,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:32,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-27 23:55:32,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361115659] [2019-11-27 23:55:32,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:55:32,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:32,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:55:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:55:32,904 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 10 states. [2019-11-27 23:55:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:33,240 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-11-27 23:55:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:33,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-27 23:55:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:33,242 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:55:33,242 INFO L226 Difference]: Without dead ends: 76 [2019-11-27 23:55:33,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:55:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-27 23:55:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-11-27 23:55:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-27 23:55:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-11-27 23:55:33,250 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 31 [2019-11-27 23:55:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:33,250 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-11-27 23:55:33,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:55:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-11-27 23:55:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:55:33,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:33,252 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:33,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:33,458 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2019-11-27 23:55:33,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:33,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922056035] [2019-11-27 23:55:33,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:33,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922056035] [2019-11-27 23:55:33,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912005544] [2019-11-27 23:55:33,547 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:55:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:33,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 23:55:33,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:33,631 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:55:33,631 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,634 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,634 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:55:33,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,654 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:55:33,655 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,666 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,675 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 11 treesize of output 7 [2019-11-27 23:55:33,675 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,690 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,690 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:55:33,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-27 23:55:33,715 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:33,716 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 27 treesize of output 11 [2019-11-27 23:55:33,716 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,722 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,723 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-27 23:55:33,753 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:55:33,754 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,761 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,762 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:33,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-27 23:55:33,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-27 23:55:33,804 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,810 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:33,811 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:33,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-27 23:55:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:33,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:33,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-27 23:55:33,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921333810] [2019-11-27 23:55:33,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:55:33,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:55:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:55:33,820 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 10 states. [2019-11-27 23:55:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:34,246 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2019-11-27 23:55:34,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:34,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-27 23:55:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:34,248 INFO L225 Difference]: With dead ends: 91 [2019-11-27 23:55:34,248 INFO L226 Difference]: Without dead ends: 87 [2019-11-27 23:55:34,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:55:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-27 23:55:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-27 23:55:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-27 23:55:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-27 23:55:34,255 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2019-11-27 23:55:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:34,255 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-27 23:55:34,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:55:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-27 23:55:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 23:55:34,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:34,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:34,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:34,462 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:34,462 INFO L82 PathProgramCache]: Analyzing trace with hash -20007500, now seen corresponding path program 1 times [2019-11-27 23:55:34,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:34,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412621716] [2019-11-27 23:55:34,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:34,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412621716] [2019-11-27 23:55:34,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324906127] [2019-11-27 23:55:34,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:55:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:34,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 23:55:34,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:34,762 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:55:34,762 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,764 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,764 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:55:34,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,805 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:55:34,806 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,812 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,813 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-27 23:55:34,839 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:55:34,839 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,849 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,855 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:55:34,855 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,868 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,869 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-27 23:55:34,895 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-11-27 23:55:34,900 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 29 treesize of output 19 [2019-11-27 23:55:34,901 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,914 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-27 23:55:34,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:34,954 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,974 INFO L588 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-27 23:55:34,978 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-27 23:55:34,979 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,983 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:34,984 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:34,984 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-27 23:55:35,010 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 39 treesize of output 21 [2019-11-27 23:55:35,011 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:35,017 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:35,019 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 23 treesize of output 11 [2019-11-27 23:55:35,019 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:35,027 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:35,027 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:35,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-27 23:55:35,032 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:55:35,032 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:35,034 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:35,034 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:35,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 23:55:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:35,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:35,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-27 23:55:35,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940693724] [2019-11-27 23:55:35,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:55:35,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:55:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:55:35,039 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-27 23:55:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:35,582 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2019-11-27 23:55:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:35,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-11-27 23:55:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:35,583 INFO L225 Difference]: With dead ends: 95 [2019-11-27 23:55:35,583 INFO L226 Difference]: Without dead ends: 91 [2019-11-27 23:55:35,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:55:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-27 23:55:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-27 23:55:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-27 23:55:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2019-11-27 23:55:35,591 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2019-11-27 23:55:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:35,591 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2019-11-27 23:55:35,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:55:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2019-11-27 23:55:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:55:35,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:35,593 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:35,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:35,803 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1998658321, now seen corresponding path program 1 times [2019-11-27 23:55:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:35,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530708645] [2019-11-27 23:55:35,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:36,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530708645] [2019-11-27 23:55:36,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279377074] [2019-11-27 23:55:36,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:55:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:36,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-27 23:55:36,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:36,104 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:55:36,105 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,107 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,107 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:55:36,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,149 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:55:36,150 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,156 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,156 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-27 23:55:36,185 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:55:36,185 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,201 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,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 13 treesize of output 9 [2019-11-27 23:55:36,208 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,217 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,218 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-27 23:55:36,241 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-11-27 23:55:36,246 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 29 treesize of output 19 [2019-11-27 23:55:36,246 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,257 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-27 23:55:36,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:36,279 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,298 INFO L588 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-27 23:55:36,302 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-27 23:55:36,303 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,308 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,309 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,309 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-27 23:55:36,337 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 39 treesize of output 21 [2019-11-27 23:55:36,337 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,344 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,349 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 23 treesize of output 11 [2019-11-27 23:55:36,349 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,353 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,353 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-27 23:55:36,358 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:55:36,358 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,359 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:36,360 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:36,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 23:55:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:36,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:36,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-27 23:55:36,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457966793] [2019-11-27 23:55:36,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:55:36,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:55:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:55:36,365 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 15 states. [2019-11-27 23:55:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:36,915 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-11-27 23:55:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:36,916 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-11-27 23:55:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:36,917 INFO L225 Difference]: With dead ends: 97 [2019-11-27 23:55:36,917 INFO L226 Difference]: Without dead ends: 87 [2019-11-27 23:55:36,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:55:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-27 23:55:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-11-27 23:55:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-27 23:55:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-11-27 23:55:36,924 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-11-27 23:55:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:36,924 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-11-27 23:55:36,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:55:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-11-27 23:55:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:55:36,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:36,926 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:37,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:37,138 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 2 times [2019-11-27 23:55:37,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:37,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500676863] [2019-11-27 23:55:37,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:37,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500676863] [2019-11-27 23:55:37,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011506218] [2019-11-27 23:55:37,322 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 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:55:37,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:55:37,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:55:37,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-27 23:55:37,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:37,409 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:55:37,409 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,431 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:55:37,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,456 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:55:37,456 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,470 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,470 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-27 23:55:37,481 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 11 treesize of output 7 [2019-11-27 23:55:37,484 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,495 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,501 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 11 treesize of output 7 [2019-11-27 23:55:37,501 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,511 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,512 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-27 23:55:37,524 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2019-11-27 23:55:37,528 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 23 treesize of output 15 [2019-11-27 23:55:37,529 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,542 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-27 23:55:37,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:37,565 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,586 INFO L588 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-11-27 23:55:37,590 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-11-27 23:55:37,591 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,598 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,598 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,598 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-27 23:55:37,638 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 31 treesize of output 19 [2019-11-27 23:55:37,639 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,645 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,648 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 19 treesize of output 11 [2019-11-27 23:55:37,648 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,656 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,656 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:55:37,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-27 23:55:37,668 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:55:37,668 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,670 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:37,670 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:37,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 23:55:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:37,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:37,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-27 23:55:37,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178755160] [2019-11-27 23:55:37,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:55:37,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:37,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:55:37,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:55:37,679 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 11 states. [2019-11-27 23:55:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:38,114 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-11-27 23:55:38,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:55:38,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-27 23:55:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:38,116 INFO L225 Difference]: With dead ends: 90 [2019-11-27 23:55:38,116 INFO L226 Difference]: Without dead ends: 77 [2019-11-27 23:55:38,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:55:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-27 23:55:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2019-11-27 23:55:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-27 23:55:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2019-11-27 23:55:38,121 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2019-11-27 23:55:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:38,122 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-11-27 23:55:38,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:55:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2019-11-27 23:55:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:55:38,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:38,123 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:38,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:38,329 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2019-11-27 23:55:38,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:38,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529247182] [2019-11-27 23:55:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:38,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529247182] [2019-11-27 23:55:38,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728250500] [2019-11-27 23:55:38,512 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:38,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:55:38,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:55:38,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-27 23:55:38,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:38,587 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:55:38,587 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,591 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,591 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:55:38,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,614 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:55:38,615 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,655 INFO L588 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-27 23:55:38,660 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 11 treesize of output 7 [2019-11-27 23:55:38,660 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,674 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,674 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:55:38,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-27 23:55:38,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:38,713 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 27 treesize of output 11 [2019-11-27 23:55:38,714 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,722 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,723 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-27 23:55:38,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,766 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 16 treesize of output 26 [2019-11-27 23:55:38,767 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,779 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,783 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 19 treesize of output 18 [2019-11-27 23:55:38,784 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,795 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,795 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:55:38,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-27 23:55:38,836 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:38,836 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:38,837 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,847 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,848 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:38,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-27 23:55:38,891 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 26 treesize of output 28 [2019-11-27 23:55:38,891 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:38,903 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:38,904 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:38,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-27 23:55:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:38,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:38,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-27 23:55:38,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927091015] [2019-11-27 23:55:38,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 23:55:38,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:38,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 23:55:38,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:55:38,978 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 18 states. [2019-11-27 23:55:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:39,708 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2019-11-27 23:55:39,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 23:55:39,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-27 23:55:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:39,709 INFO L225 Difference]: With dead ends: 109 [2019-11-27 23:55:39,709 INFO L226 Difference]: Without dead ends: 101 [2019-11-27 23:55:39,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:55:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-27 23:55:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2019-11-27 23:55:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-27 23:55:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-11-27 23:55:39,718 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 35 [2019-11-27 23:55:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:39,719 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-11-27 23:55:39,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 23:55:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-11-27 23:55:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:55:39,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:39,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:39,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:39,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:39,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2019-11-27 23:55:39,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:39,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181024950] [2019-11-27 23:55:39,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181024950] [2019-11-27 23:55:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685782088] [2019-11-27 23:55:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:40,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-27 23:55:40,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:40,182 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:55:40,183 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,188 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,188 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:55:40,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,258 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:55:40,258 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,285 INFO L588 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-27 23:55:40,291 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 11 treesize of output 7 [2019-11-27 23:55:40,291 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,304 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,304 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:55:40,304 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-11-27 23:55:40,345 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:40,346 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 27 treesize of output 11 [2019-11-27 23:55:40,346 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,353 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,354 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-11-27 23:55:40,394 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,394 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 16 treesize of output 26 [2019-11-27 23:55:40,395 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,405 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,408 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 19 treesize of output 18 [2019-11-27 23:55:40,409 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,417 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,418 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:55:40,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-11-27 23:55:40,461 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:55:40,461 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:55:40,462 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,473 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,474 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:40,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2019-11-27 23:55:40,517 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 26 treesize of output 28 [2019-11-27 23:55:40,518 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,530 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,531 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:40,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-27 23:55:40,573 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-27 23:55:40,574 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,581 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:40,581 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:40,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-27 23:55:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:40,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:40,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-27 23:55:40,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513936704] [2019-11-27 23:55:40,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-27 23:55:40,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-27 23:55:40,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-11-27 23:55:40,603 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 20 states. [2019-11-27 23:55:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:41,539 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2019-11-27 23:55:41,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 23:55:41,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-11-27 23:55:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:41,540 INFO L225 Difference]: With dead ends: 131 [2019-11-27 23:55:41,540 INFO L226 Difference]: Without dead ends: 125 [2019-11-27 23:55:41,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 23:55:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-27 23:55:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2019-11-27 23:55:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-27 23:55:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-11-27 23:55:41,546 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 35 [2019-11-27 23:55:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:41,546 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-11-27 23:55:41,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-27 23:55:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-11-27 23:55:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 23:55:41,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:41,547 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:41,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:41,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -233446117, now seen corresponding path program 3 times [2019-11-27 23:55:41,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:41,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773790850] [2019-11-27 23:55:41,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:55:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:55:42,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773790850] [2019-11-27 23:55:42,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102324975] [2019-11-27 23:55:42,031 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:42,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 23:55:42,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:55:42,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-27 23:55:42,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:55:42,162 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:55:42,163 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,169 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,170 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:55:42,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,198 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:55:42,199 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,227 INFO L588 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-27 23:55:42,227 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-27 23:55:42,267 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 11 treesize of output 7 [2019-11-27 23:55:42,268 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,289 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,295 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 11 treesize of output 7 [2019-11-27 23:55:42,295 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,310 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,311 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:55:42,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-27 23:55:42,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,363 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 20 treesize of output 30 [2019-11-27 23:55:42,364 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,394 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,395 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_53|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_53|]} [2019-11-27 23:55:42,402 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 11 treesize of output 7 [2019-11-27 23:55:42,402 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,427 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:42,433 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 30 treesize of output 14 [2019-11-27 23:55:42,434 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,457 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:42,463 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 39 treesize of output 19 [2019-11-27 23:55:42,464 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,485 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,486 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:55:42,486 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:43 [2019-11-27 23:55:42,533 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 116 [2019-11-27 23:55:42,534 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,563 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:55:42,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,577 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 125 [2019-11-27 23:55:42,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:42,578 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,632 INFO L588 ElimStorePlain]: treesize reduction 24, result has 85.8 percent of original size [2019-11-27 23:55:42,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:55:42,639 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 55 treesize of output 19 [2019-11-27 23:55:42,639 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,674 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,674 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:55:42,675 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:117 [2019-11-27 23:55:42,724 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_int_55|], 6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_55|]} [2019-11-27 23:55:42,729 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 69 treesize of output 54 [2019-11-27 23:55:42,729 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,777 INFO L588 ElimStorePlain]: treesize reduction 22, result has 92.4 percent of original size [2019-11-27 23:55:42,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 258 [2019-11-27 23:55:42,828 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,844 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,851 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2019-11-27 23:55:42,852 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,880 INFO L588 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-27 23:55:42,880 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:55:42,880 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:306, output treesize:60 [2019-11-27 23:55:42,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:42,970 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 57 treesize of output 40 [2019-11-27 23:55:42,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:42,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:55:42,971 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:55:43,010 INFO L588 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-27 23:55:43,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-27 23:55:43,014 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:55:43,025 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:55:43,025 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:55:43,026 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-27 23:55:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:55:43,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:55:43,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-11-27 23:55:43,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654470857] [2019-11-27 23:55:43,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-27 23:55:43,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:55:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-27 23:55:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-27 23:55:43,113 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 21 states. [2019-11-27 23:55:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:55:44,143 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2019-11-27 23:55:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 23:55:44,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-11-27 23:55:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:55:44,146 INFO L225 Difference]: With dead ends: 118 [2019-11-27 23:55:44,146 INFO L226 Difference]: Without dead ends: 112 [2019-11-27 23:55:44,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2019-11-27 23:55:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-27 23:55:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2019-11-27 23:55:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 23:55:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-27 23:55:44,153 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 37 [2019-11-27 23:55:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:55:44,153 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-27 23:55:44,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-27 23:55:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-27 23:55:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 23:55:44,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:55:44,154 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:55:44,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:55:44,358 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:55:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:55:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1007382053, now seen corresponding path program 1 times [2019-11-27 23:55:44,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:55:44,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728530183] [2019-11-27 23:55:44,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:55:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:55:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:55:44,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:55:44,443 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:55:44,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:55:44 BoogieIcfgContainer [2019-11-27 23:55:44,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:55:44,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:55:44,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:55:44,506 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:55:44,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:55:31" (3/4) ... [2019-11-27 23:55:44,509 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:55:44,597 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:55:44,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:55:44,601 INFO L168 Benchmark]: Toolchain (without parser) took 14848.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 961.7 MB in the beginning and 904.9 MB in the end (delta: 56.7 MB). Peak memory consumption was 386.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:44,602 INFO L168 Benchmark]: CDTParser took 0.25 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:55:44,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:44,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:44,605 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 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:55:44,606 INFO L168 Benchmark]: RCFGBuilder took 601.83 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:44,608 INFO L168 Benchmark]: TraceAbstraction took 13431.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 904.9 MB in the end (delta: 167.1 MB). Peak memory consumption was 355.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:55:44,608 INFO L168 Benchmark]: Witness Printer took 92.07 ms. Allocated memory is still 1.4 GB. Free memory is still 904.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:55:44,611 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.25 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 614.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.98 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 601.83 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13431.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 904.9 MB in the end (delta: 167.1 MB). Peak memory consumption was 355.9 MB. Max. memory is 11.5 GB. * Witness Printer took 92.07 ms. Allocated memory is still 1.4 GB. Free memory is still 904.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) [L565] COND FALSE !(\read(*root)) [L584] List a = (List) malloc(sizeof(struct node)); [L585] COND FALSE !(a == 0) [L586] List t; [L587] List p = a; [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) [L591] COND FALSE !(t == 0) [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) [L598] COND FALSE !(t == 0) [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a [L604] EXPR p->h [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 760 SDtfs, 1050 SDslu, 3392 SDs, 0 SdLazy, 2445 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 251 SyntacticMatches, 8 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 671 ConstructedInterpolants, 17 QuantifiedInterpolants, 185717 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1198 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 32/112 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...