./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list-2.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 6439b1baef116d71fdff38c675a38b8a29c42257 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:52:22,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:52:22,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:52:22,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:52:22,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:52:22,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:52:22,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:52:22,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:52:22,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:52:22,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:52:22,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:52:22,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:52:22,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:52:22,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:52:22,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:52:22,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:52:22,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:52:22,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:52:22,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:52:22,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:52:22,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:52:22,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:52:22,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:52:22,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:52:22,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:52:22,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:52:22,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:52:22,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:52:22,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:52:22,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:52:22,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:52:22,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:52:22,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:52:22,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:52:22,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:52:22,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:52:22,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:52:22,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:52:22,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:52:22,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:52:22,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:52:22,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:52:22,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:52:22,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:52:22,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:52:22,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:52:22,114 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:52:22,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:52:22,117 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:52:22,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:52:22,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:52:22,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:52:22,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:52:22,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:52:22,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:52:22,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:52:22,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:52:22,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:52:22,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:52:22,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:52:22,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:52:22,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:52:22,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:52:22,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:52:22,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:52:22,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:52:22,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:52:22,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:52:22,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:52:22,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:52:22,126 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 -> 6439b1baef116d71fdff38c675a38b8a29c42257 [2019-11-27 23:52:22,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:52:22,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:52:22,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:52:22,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:52:22,494 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:52:22,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2019-11-27 23:52:22,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77b3ea1b/19cda162c094435a91cb6bc6b929ba35/FLAG5479512df [2019-11-27 23:52:23,065 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:52:23,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2019-11-27 23:52:23,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77b3ea1b/19cda162c094435a91cb6bc6b929ba35/FLAG5479512df [2019-11-27 23:52:23,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77b3ea1b/19cda162c094435a91cb6bc6b929ba35 [2019-11-27 23:52:23,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:52:23,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:52:23,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:52:23,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:52:23,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:52:23,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:52:23" (1/1) ... [2019-11-27 23:52:23,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aae0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:23, skipping insertion in model container [2019-11-27 23:52:23,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:52:23" (1/1) ... [2019-11-27 23:52:23,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:52:23,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:52:23,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:52:23,908 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:52:23,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:52:24,013 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:52:24,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24 WrapperNode [2019-11-27 23:52:24,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:52:24,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:52:24,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:52:24,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:52:24,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:52:24,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:52:24,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:52:24,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:52:24,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... [2019-11-27 23:52:24,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:52:24,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:52:24,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:52:24,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:52:24,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:52:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:52:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:52:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:52:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:52:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:52:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:52:24,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:52:24,513 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:52:24,513 INFO L297 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-27 23:52:24,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:24 BoogieIcfgContainer [2019-11-27 23:52:24,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:52:24,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:52:24,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:52:24,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:52:24,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:52:23" (1/3) ... [2019-11-27 23:52:24,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640bfc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:52:24, skipping insertion in model container [2019-11-27 23:52:24,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:52:24" (2/3) ... [2019-11-27 23:52:24,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640bfc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:52:24, skipping insertion in model container [2019-11-27 23:52:24,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:24" (3/3) ... [2019-11-27 23:52:24,528 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2019-11-27 23:52:24,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:52:24,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:52:24,555 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:52:24,573 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:52:24,573 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:52:24,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:52:24,573 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:52:24,573 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:52:24,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:52:24,574 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:52:24,574 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:52:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-27 23:52:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 23:52:24,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:24,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:24,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1661254537, now seen corresponding path program 1 times [2019-11-27 23:52:24,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:24,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119881843] [2019-11-27 23:52:24,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119881843] [2019-11-27 23:52:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:24,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:52:24,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802325997] [2019-11-27 23:52:24,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:52:24,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:52:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:52:24,742 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-11-27 23:52:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:24,757 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-11-27 23:52:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:52:24,759 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-27 23:52:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:24,768 INFO L225 Difference]: With dead ends: 46 [2019-11-27 23:52:24,769 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 23:52:24,772 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:52:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 23:52:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-27 23:52:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 23:52:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-27 23:52:24,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-27 23:52:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:24,806 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-27 23:52:24,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:52:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-27 23:52:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:52:24,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:24,807 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:52:24,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 57591681, now seen corresponding path program 1 times [2019-11-27 23:52:24,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:24,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715167672] [2019-11-27 23:52:24,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:24,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715167672] [2019-11-27 23:52:24,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:24,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:52:24,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539208289] [2019-11-27 23:52:24,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:52:24,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:52:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:52:24,943 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-27 23:52:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:25,083 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-27 23:52:25,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:52:25,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-27 23:52:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:25,088 INFO L225 Difference]: With dead ends: 46 [2019-11-27 23:52:25,089 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:52:25,090 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:52:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:52:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-27 23:52:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:52:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-27 23:52:25,106 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2019-11-27 23:52:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:25,107 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-27 23:52:25,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:52:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-27 23:52:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:52:25,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:25,109 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:25,109 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -440293124, now seen corresponding path program 1 times [2019-11-27 23:52:25,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:25,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449887150] [2019-11-27 23:52:25,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:25,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449887150] [2019-11-27 23:52:25,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:25,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:52:25,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808915939] [2019-11-27 23:52:25,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:52:25,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:25,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:52:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:52:25,221 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-11-27 23:52:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:25,358 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-27 23:52:25,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:52:25,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-27 23:52:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:25,361 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:52:25,361 INFO L226 Difference]: Without dead ends: 40 [2019-11-27 23:52:25,361 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:52:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-27 23:52:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-27 23:52:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:52:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-27 23:52:25,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-27 23:52:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:25,370 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-27 23:52:25,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:52:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-27 23:52:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:52:25,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:25,372 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:25,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 584409852, now seen corresponding path program 1 times [2019-11-27 23:52:25,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:25,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051578381] [2019-11-27 23:52:25,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:25,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051578381] [2019-11-27 23:52:25,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:52:25,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:52:25,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247443993] [2019-11-27 23:52:25,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:52:25,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:52:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:52:25,479 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-11-27 23:52:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:25,578 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-27 23:52:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:52:25,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-27 23:52:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:25,580 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:52:25,580 INFO L226 Difference]: Without dead ends: 37 [2019-11-27 23:52:25,581 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:52:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-27 23:52:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-11-27 23:52:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-27 23:52:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-27 23:52:25,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-27 23:52:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:25,586 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-27 23:52:25,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:52:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-27 23:52:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:52:25,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:25,587 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:25,587 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:25,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1573518424, now seen corresponding path program 1 times [2019-11-27 23:52:25,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:25,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287677246] [2019-11-27 23:52:25,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:25,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287677246] [2019-11-27 23:52:25,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939715785] [2019-11-27 23:52:25,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:25,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 23:52:25,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:25,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:25,906 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:25,911 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:25,911 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:25,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:52:25,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:25,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:25,950 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:25,963 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:25,972 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:52:25,972 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:25,983 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:25,983 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:25,984 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-27 23:52:26,021 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:52:26,022 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:52:26,023 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,032 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,032 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-27 23:52:26,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 23:52:26,063 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,071 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,072 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:52:26,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-27 23:52:26,110 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:52:26,111 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,117 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,118 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:52:26,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-27 23:52:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:26,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:26,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-27 23:52:26,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371300973] [2019-11-27 23:52:26,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:52:26,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:26,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:52:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:52:26,130 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2019-11-27 23:52:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:26,390 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-27 23:52:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:52:26,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-27 23:52:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:26,392 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:52:26,392 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 23:52:26,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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:52:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 23:52:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-11-27 23:52:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:52:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-27 23:52:26,398 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2019-11-27 23:52:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:26,398 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-27 23:52:26,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:52:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-27 23:52:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:52:26,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:26,400 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:26,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:26,605 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -710116760, now seen corresponding path program 1 times [2019-11-27 23:52:26,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:26,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284470516] [2019-11-27 23:52:26,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:26,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284470516] [2019-11-27 23:52:26,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941852937] [2019-11-27 23:52:26,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:26,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 23:52:26,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:26,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:26,827 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,828 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,829 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:52:26,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:26,847 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,856 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,861 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:52:26,861 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,875 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,876 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-27 23:52:26,907 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:52:26,908 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:52:26,909 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,913 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,914 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-27 23:52:26,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 23:52:26,939 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:26,947 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:26,948 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:52:26,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-27 23:52:26,998 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:52:26,999 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,003 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:27,004 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:52:27,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-27 23:52:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:27,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:27,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-27 23:52:27,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700278731] [2019-11-27 23:52:27,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:52:27,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:52:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:52:27,010 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 10 states. [2019-11-27 23:52:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:27,334 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-11-27 23:52:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:52:27,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-27 23:52:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:27,336 INFO L225 Difference]: With dead ends: 59 [2019-11-27 23:52:27,336 INFO L226 Difference]: Without dead ends: 55 [2019-11-27 23:52:27,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:52:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-27 23:52:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2019-11-27 23:52:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:52:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-27 23:52:27,343 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2019-11-27 23:52:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:27,344 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-27 23:52:27,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:52:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-27 23:52:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:52:27,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:27,345 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] [2019-11-27 23:52:27,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:27,557 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash 750661987, now seen corresponding path program 1 times [2019-11-27 23:52:27,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:27,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073394628] [2019-11-27 23:52:27,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:27,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073394628] [2019-11-27 23:52:27,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15981003] [2019-11-27 23:52:27,734 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:52:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:27,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 23:52:27,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:27,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:27,793 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,796 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:27,796 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:52:27,836 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:27,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:27,838 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,843 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:27,844 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-27 23:52:27,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:52:27,903 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,915 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:27,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:52:27,921 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,933 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:27,934 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:52:27,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-27 23:52:27,967 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|]} [2019-11-27 23:52:27,974 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:52:27,974 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:27,986 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,014 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:52:28,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:52:28,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:28,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:28,020 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-27 23:52:28,049 INFO L588 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-27 23:52:28,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-27 23:52:28,054 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,058 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,058 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,059 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-27 23:52:28,093 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:52:28,094 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,111 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,114 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:52:28,114 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,121 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,121 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:52:28,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-27 23:52:28,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:52:28,129 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,134 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,134 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:52:28,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 23:52:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:28,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:28,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-27 23:52:28,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18684548] [2019-11-27 23:52:28,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:52:28,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:52:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:52:28,146 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2019-11-27 23:52:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:28,511 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-27 23:52:28,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:52:28,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-27 23:52:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:28,513 INFO L225 Difference]: With dead ends: 63 [2019-11-27 23:52:28,513 INFO L226 Difference]: Without dead ends: 59 [2019-11-27 23:52:28,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:52:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-27 23:52:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-27 23:52:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:52:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-11-27 23:52:28,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2019-11-27 23:52:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:28,520 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-27 23:52:28,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:52:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-11-27 23:52:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:52:28,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:28,521 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] [2019-11-27 23:52:28,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:28,722 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash -119659938, now seen corresponding path program 1 times [2019-11-27 23:52:28,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:28,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432758243] [2019-11-27 23:52:28,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:28,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432758243] [2019-11-27 23:52:28,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243982823] [2019-11-27 23:52:28,876 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:52:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:28,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-27 23:52:28,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:28,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:28,939 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,944 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,944 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-27 23:52:28,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:28,990 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,996 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:28,997 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:28,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-27 23:52:29,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:52:29,028 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,042 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 23:52:29,048 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,061 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,061 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:52:29,062 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-27 23:52:29,094 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-27 23:52:29,098 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:52:29,098 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,110 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,131 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:52:29,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:52:29,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:29,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:29,133 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-27 23:52:29,160 INFO L588 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-27 23:52:29,165 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:52:29,166 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,171 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,171 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,171 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-27 23:52:29,198 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:52:29,199 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,207 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,212 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:52:29,213 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,220 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,221 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:52:29,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-27 23:52:29,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:52:29,239 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,241 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,241 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:52:29,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 23:52:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:29,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:29,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-27 23:52:29,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925952657] [2019-11-27 23:52:29,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:52:29,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:52:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:52:29,246 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 14 states. [2019-11-27 23:52:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:29,579 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-27 23:52:29,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:52:29,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-27 23:52:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:29,580 INFO L225 Difference]: With dead ends: 65 [2019-11-27 23:52:29,581 INFO L226 Difference]: Without dead ends: 55 [2019-11-27 23:52:29,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:52:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-27 23:52:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-27 23:52:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-27 23:52:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-27 23:52:29,587 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2019-11-27 23:52:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:29,587 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-27 23:52:29,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:52:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-27 23:52:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:52:29,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:29,589 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] [2019-11-27 23:52:29,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:29,793 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:29,793 INFO L82 PathProgramCache]: Analyzing trace with hash 905043038, now seen corresponding path program 2 times [2019-11-27 23:52:29,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:29,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377217748] [2019-11-27 23:52:29,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:29,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377217748] [2019-11-27 23:52:29,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008140577] [2019-11-27 23:52:29,916 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:52:29,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:52:29,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:52:29,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-27 23:52:29,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:29,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:29,984 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,991 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:29,992 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:29,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:52:30,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:30,005 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,011 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,012 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-27 23:52:30,026 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:52:30,027 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,037 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,041 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:52:30,042 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,055 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,056 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:52:30,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-27 23:52:30,067 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2019-11-27 23:52:30,071 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:52:30,071 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,089 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,093 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 86 treesize of output 68 [2019-11-27 23:52:30,094 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,104 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,125 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 59 treesize of output 85 [2019-11-27 23:52:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:52:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:30,128 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-27 23:52:30,148 INFO L588 ElimStorePlain]: treesize reduction 77, result has 26.0 percent of original size [2019-11-27 23:52:30,148 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,149 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-27 23:52:30,169 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:52:30,170 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,177 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,179 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:52:30,179 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,183 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,184 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-27 23:52:30,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:52:30,188 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,189 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,189 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:52:30,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-27 23:52:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:30,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:30,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-27 23:52:30,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997488304] [2019-11-27 23:52:30,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:52:30,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:52:30,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:52:30,194 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 10 states. [2019-11-27 23:52:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:30,449 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-11-27 23:52:30,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:52:30,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-27 23:52:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:30,451 INFO L225 Difference]: With dead ends: 58 [2019-11-27 23:52:30,451 INFO L226 Difference]: Without dead ends: 45 [2019-11-27 23:52:30,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:52:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-27 23:52:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-11-27 23:52:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-27 23:52:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-27 23:52:30,456 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2019-11-27 23:52:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:30,456 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-27 23:52:30,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:52:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-27 23:52:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:52:30,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:30,457 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:30,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:30,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -719006641, now seen corresponding path program 2 times [2019-11-27 23:52:30,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:30,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145670299] [2019-11-27 23:52:30,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:30,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145670299] [2019-11-27 23:52:30,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390455698] [2019-11-27 23:52:30,874 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:52:30,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:52:30,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:52:30,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-27 23:52:30,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:30,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:30,932 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,938 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:30,938 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:30,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:52:31,001 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:52:31,004 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,058 INFO L588 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-27 23:52:31,063 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:52:31,064 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,078 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,078 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-27 23:52:31,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:31,129 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:52:31,130 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,141 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,142 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-27 23:52:31,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,216 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:52:31,216 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,230 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,235 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:52:31,235 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,247 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,247 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-27 23:52:31,305 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:52:31,305 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:52:31,306 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,317 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,319 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:52:31,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-27 23:52:31,370 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:52:31,371 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:31,387 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:31,388 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:52:31,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-27 23:52:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:31,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:31,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-27 23:52:31,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920440548] [2019-11-27 23:52:31,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 23:52:31,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:31,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 23:52:31,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:52:31,485 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 18 states. [2019-11-27 23:52:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:32,076 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-11-27 23:52:32,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 23:52:32,076 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-27 23:52:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:32,077 INFO L225 Difference]: With dead ends: 77 [2019-11-27 23:52:32,077 INFO L226 Difference]: Without dead ends: 69 [2019-11-27 23:52:32,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:52:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-27 23:52:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-11-27 23:52:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-27 23:52:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-27 23:52:32,083 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2019-11-27 23:52:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:32,084 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-27 23:52:32,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 23:52:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-11-27 23:52:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:52:32,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:32,085 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:52:32,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:32,289 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash -419304689, now seen corresponding path program 1 times [2019-11-27 23:52:32,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:32,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983315483] [2019-11-27 23:52:32,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:32,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983315483] [2019-11-27 23:52:32,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134365706] [2019-11-27 23:52:32,446 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:52:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:32,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-27 23:52:32,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:32,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:32,499 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,508 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,508 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:52:32,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:52:32,522 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,530 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,536 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:52:32,537 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,545 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,546 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,546 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-27 23:52:32,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:32,561 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:52:32,561 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,566 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,567 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-27 23:52:32,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:32,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 23:52:32,609 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,617 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,618 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-27 23:52:32,650 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-27 23:52:32,651 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-27 23:52:32,652 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,662 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,662 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:52:32,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-27 23:52:32,725 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:32,725 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-27 23:52:32,726 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:32,767 INFO L588 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-27 23:52:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,770 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:32,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-27 23:52:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:33,011 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:52:33,011 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,015 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:33,015 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:33,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-27 23:52:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:33,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:33,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-27 23:52:33,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130823109] [2019-11-27 23:52:33,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 23:52:33,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 23:52:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-27 23:52:33,025 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 17 states. [2019-11-27 23:52:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:33,866 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-11-27 23:52:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 23:52:33,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-27 23:52:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:33,867 INFO L225 Difference]: With dead ends: 95 [2019-11-27 23:52:33,867 INFO L226 Difference]: Without dead ends: 89 [2019-11-27 23:52:33,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-11-27 23:52:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-27 23:52:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2019-11-27 23:52:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-27 23:52:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-11-27 23:52:33,878 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 24 [2019-11-27 23:52:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:33,882 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-11-27 23:52:33,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 23:52:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-11-27 23:52:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:52:33,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:33,884 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] [2019-11-27 23:52:34,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:34,093 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1597731914, now seen corresponding path program 3 times [2019-11-27 23:52:34,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:34,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082357648] [2019-11-27 23:52:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:52:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:34,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082357648] [2019-11-27 23:52:34,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806259372] [2019-11-27 23:52:34,382 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:52:34,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 23:52:34,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:52:34,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-27 23:52:34,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:52:34,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:52:34,448 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,452 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,452 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-27 23:52:34,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-27 23:52:34,476 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,505 INFO L588 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-27 23:52:34,505 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-27 23:52:34,562 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:52:34,562 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,578 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,584 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:52:34,584 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,602 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,603 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-27 23:52:34,659 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,659 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:52:34,660 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,688 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,691 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 2=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_21|]} [2019-11-27 23:52:34,696 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:52:34,696 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,724 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:34,732 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:52:34,733 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,754 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,759 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 30 treesize of output 14 [2019-11-27 23:52:34,759 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,777 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,777 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,777 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:40 [2019-11-27 23:52:34,821 INFO L404 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_22|]} [2019-11-27 23:52:34,827 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 39 treesize of output 15 [2019-11-27 23:52:34,827 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,852 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,868 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 77 treesize of output 67 [2019-11-27 23:52:34,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:34,870 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,915 INFO L588 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-27 23:52:34,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:52:34,924 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 27 treesize of output 22 [2019-11-27 23:52:34,924 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,943 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:34,944 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:52:34,944 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:61 [2019-11-27 23:52:34,993 INFO L404 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|, |v_#memory_$Pointer$.offset_23|], 5=[|v_#memory_$Pointer$.base_27|]} [2019-11-27 23:52:35,008 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 30 [2019-11-27 23:52:35,009 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,031 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,036 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 47 treesize of output 11 [2019-11-27 23:52:35,037 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,054 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,095 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 118 [2019-11-27 23:52:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:52:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,102 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-27 23:52:35,169 INFO L588 ElimStorePlain]: treesize reduction 291, result has 18.3 percent of original size [2019-11-27 23:52:35,170 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:35,170 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2019-11-27 23:52:35,216 INFO L404 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[|#memory_$Pointer$.base|]} [2019-11-27 23:52:35,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-27 23:52:35,220 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:52:35,231 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:52:35,239 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 62 treesize of output 37 [2019-11-27 23:52:35,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:52:35,241 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:35,261 INFO L588 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-11-27 23:52:35,262 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:52:35,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-27 23:52:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:52:35,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:52:35,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-11-27 23:52:35,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229089] [2019-11-27 23:52:35,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 23:52:35,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:52:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 23:52:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:52:35,340 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 19 states. [2019-11-27 23:52:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:52:35,968 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-27 23:52:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:52:35,969 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-27 23:52:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:52:35,970 INFO L225 Difference]: With dead ends: 88 [2019-11-27 23:52:35,970 INFO L226 Difference]: Without dead ends: 82 [2019-11-27 23:52:35,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-27 23:52:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-27 23:52:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2019-11-27 23:52:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-27 23:52:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-27 23:52:35,977 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 26 [2019-11-27 23:52:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:52:35,977 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-27 23:52:35,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 23:52:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-11-27 23:52:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:52:35,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:52:35,979 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] [2019-11-27 23:52:36,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:52:36,189 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:52:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:52:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash 823795978, now seen corresponding path program 1 times [2019-11-27 23:52:36,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:52:36,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674144844] [2019-11-27 23:52:36,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:52:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:52:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:52:36,247 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:52:36,248 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:52:36,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:52:36 BoogieIcfgContainer [2019-11-27 23:52:36,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:52:36,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:52:36,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:52:36,296 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:52:36,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:52:24" (3/4) ... [2019-11-27 23:52:36,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:52:36,348 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:52:36,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:52:36,349 INFO L168 Benchmark]: Toolchain (without parser) took 12971.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -223.8 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:36,350 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:36,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:36,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:36,351 INFO L168 Benchmark]: Boogie Preprocessor took 27.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:52:36,351 INFO L168 Benchmark]: RCFGBuilder took 420.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:36,351 INFO L168 Benchmark]: TraceAbstraction took 11773.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.3 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:36,352 INFO L168 Benchmark]: Witness Printer took 52.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:52:36,353 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.26 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 635.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.96 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 420.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11773.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.3 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. * Witness Printer took 52.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); [L522] COND FALSE !(a == 0) [L523] List t; [L524] List p = a; [L525] COND TRUE __VERIFIER_nondet_int() [L526] p->h = 1 [L527] t = (List) malloc(sizeof(struct node)) [L528] COND FALSE !(t == 0) [L529] p->n = t [L530] EXPR p->n [L530] p = p->n [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND TRUE __VERIFIER_nondet_int() [L533] p->h = 2 [L534] t = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(t == 0) [L536] p->n = t [L537] EXPR p->n [L537] p = p->n [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 [L540] p = a [L541] EXPR p->h [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h [L543] COND TRUE p->h == 1 [L544] EXPR p->n [L544] p = p->n [L543] EXPR p->h [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 223 SDtfs, 651 SDslu, 1153 SDs, 0 SdLazy, 1853 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 152 SyntacticMatches, 15 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 171 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 412 ConstructedInterpolants, 21 QuantifiedInterpolants, 116503 SizeOfPredicates, 91 NumberOfNonLiveVariables, 734 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 16/92 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...