./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 f470102c 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.25-f470102 [2019-11-28 16:56:36,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:56:36,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:56:36,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:56:36,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:56:36,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:56:36,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:56:36,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:56:36,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:56:36,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:56:36,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:56:36,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:56:36,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:56:36,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:56:36,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:56:36,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:56:36,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:56:36,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:56:36,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:56:36,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:56:36,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:56:36,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:56:36,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:56:36,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:56:36,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:56:36,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:56:36,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:56:36,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:56:36,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:56:36,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:56:36,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:56:36,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:56:36,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:56:36,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:56:36,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:56:36,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:56:36,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:56:36,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:56:36,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:56:36,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:56:36,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:56:36,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:56:36,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:56:36,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:56:36,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:56:36,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:56:36,422 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:56:36,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:56:36,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:56:36,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:56:36,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:56:36,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:56:36,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:56:36,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:56:36,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:56:36,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:56:36,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:56:36,427 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:56:36,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:56:36,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:56:36,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:56:36,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:56:36,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:56:36,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:56:36,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:56:36,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:56:36,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:56:36,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:56:36,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:56:36,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:56:36,431 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:56:36,431 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-28 16:56:36,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:56:36,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:56:36,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:56:36,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:56:36,781 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:56:36,783 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-28 16:56:36,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a50ea7c1/a02b8fa2099746f49628e7cbe28ea532/FLAG56f0a823b [2019-11-28 16:56:37,409 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:56:37,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2019-11-28 16:56:37,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a50ea7c1/a02b8fa2099746f49628e7cbe28ea532/FLAG56f0a823b [2019-11-28 16:56:37,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a50ea7c1/a02b8fa2099746f49628e7cbe28ea532 [2019-11-28 16:56:37,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:56:37,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:56:37,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:56:37,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:56:37,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:56:37,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:37" (1/1) ... [2019-11-28 16:56:37,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2f814c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:37, skipping insertion in model container [2019-11-28 16:56:37,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:37" (1/1) ... [2019-11-28 16:56:37,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:56:37,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:56:38,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:56:38,179 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:56:38,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:56:38,287 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:56:38,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38 WrapperNode [2019-11-28 16:56:38,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:56:38,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:56:38,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:56:38,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:56:38,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:56:38,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:56:38,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:56:38,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:56:38,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (1/1) ... [2019-11-28 16:56:38,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:56:38,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:56:38,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:56:38,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:56:38,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (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-28 16:56:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:56:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:56:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:56:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:56:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:56:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:56:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:56:38,837 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:56:38,837 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 16:56:38,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:38 BoogieIcfgContainer [2019-11-28 16:56:38,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:56:38,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:56:38,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:56:38,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:56:38,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:56:37" (1/3) ... [2019-11-28 16:56:38,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5c15ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:38, skipping insertion in model container [2019-11-28 16:56:38,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:38" (2/3) ... [2019-11-28 16:56:38,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5c15ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:38, skipping insertion in model container [2019-11-28 16:56:38,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:38" (3/3) ... [2019-11-28 16:56:38,851 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2019-11-28 16:56:38,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:56:38,869 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:56:38,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:56:38,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:56:38,901 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:56:38,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:56:38,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:56:38,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:56:38,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:56:38,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:56:38,902 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:56:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 16:56:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 16:56:38,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:38,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:38,924 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1661254537, now seen corresponding path program 1 times [2019-11-28 16:56:38,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:38,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826853037] [2019-11-28 16:56:38,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:39,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826853037] [2019-11-28 16:56:39,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:39,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:56:39,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994726690] [2019-11-28 16:56:39,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:56:39,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:56:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:56:39,096 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-11-28 16:56:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:39,119 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-11-28 16:56:39,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:56:39,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-28 16:56:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:39,132 INFO L225 Difference]: With dead ends: 46 [2019-11-28 16:56:39,133 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 16:56:39,136 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-28 16:56:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 16:56:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 16:56:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 16:56:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-28 16:56:39,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-28 16:56:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:39,178 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-28 16:56:39,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:56:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-28 16:56:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:56:39,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:39,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:39,180 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 57591681, now seen corresponding path program 1 times [2019-11-28 16:56:39,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:39,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401030851] [2019-11-28 16:56:39,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:39,328 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-28 16:56:39,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401030851] [2019-11-28 16:56:39,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:39,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:56:39,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424057070] [2019-11-28 16:56:39,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:56:39,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:56:39,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:39,336 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-28 16:56:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:39,485 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-28 16:56:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:56:39,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 16:56:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:39,488 INFO L225 Difference]: With dead ends: 46 [2019-11-28 16:56:39,489 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 16:56:39,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:56:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 16:56:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-28 16:56:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:56:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 16:56:39,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2019-11-28 16:56:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:39,504 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 16:56:39,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:56:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-28 16:56:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:56:39,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:39,507 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:39,507 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash -440293124, now seen corresponding path program 1 times [2019-11-28 16:56:39,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:39,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455863292] [2019-11-28 16:56:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:39,607 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-28 16:56:39,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455863292] [2019-11-28 16:56:39,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:39,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:56:39,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843000236] [2019-11-28 16:56:39,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:56:39,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:56:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:39,609 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-11-28 16:56:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:39,714 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-28 16:56:39,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:56:39,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 16:56:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:39,717 INFO L225 Difference]: With dead ends: 48 [2019-11-28 16:56:39,717 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 16:56:39,717 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-28 16:56:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 16:56:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-28 16:56:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 16:56:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-28 16:56:39,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-28 16:56:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:39,724 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-28 16:56:39,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:56:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-28 16:56:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:56:39,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:39,725 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:39,725 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash 584409852, now seen corresponding path program 1 times [2019-11-28 16:56:39,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:39,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473774123] [2019-11-28 16:56:39,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:39,810 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-28 16:56:39,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473774123] [2019-11-28 16:56:39,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:39,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:56:39,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188062916] [2019-11-28 16:56:39,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:56:39,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:39,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:56:39,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:39,814 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-11-28 16:56:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:39,912 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-28 16:56:39,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:56:39,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 16:56:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:39,915 INFO L225 Difference]: With dead ends: 48 [2019-11-28 16:56:39,915 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 16:56:39,916 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-28 16:56:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 16:56:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-11-28 16:56:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 16:56:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-28 16:56:39,921 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-28 16:56:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:39,921 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-28 16:56:39,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:56:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-28 16:56:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:56:39,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:39,923 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-28 16:56:39,923 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1573518424, now seen corresponding path program 1 times [2019-11-28 16:56:39,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:39,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012782263] [2019-11-28 16:56:39,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:40,107 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-28 16:56:40,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012782263] [2019-11-28 16:56:40,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344121233] [2019-11-28 16:56:40,108 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-28 16:56:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:40,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 16:56:40,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:40,241 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-28 16:56:40,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,249 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:56:40,281 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,282 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-28 16:56:40,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,306 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-28 16:56:40,306 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,317 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-28 16:56:40,340 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:56:40,340 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-28 16:56:40,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-28 16:56:40,371 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-28 16:56:40,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,380 INFO L534 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-28 16:56:40,380 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 16:56:40,412 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-28 16:56:40,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:40,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:40,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 16:56:40,424 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-28 16:56:40,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:40,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 16:56:40,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356886790] [2019-11-28 16:56:40,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:56:40,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:56:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:56:40,427 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2019-11-28 16:56:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:40,750 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-28 16:56:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:56:40,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 16:56:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:40,752 INFO L225 Difference]: With dead ends: 50 [2019-11-28 16:56:40,752 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 16:56:40,753 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-28 16:56:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 16:56:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-11-28 16:56:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 16:56:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-28 16:56:40,759 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2019-11-28 16:56:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:40,760 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-28 16:56:40,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:56:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-28 16:56:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:56:40,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:40,762 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-28 16:56:40,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:40,963 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash -710116760, now seen corresponding path program 1 times [2019-11-28 16:56:40,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:40,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804387252] [2019-11-28 16:56:40,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:41,082 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-28 16:56:41,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804387252] [2019-11-28 16:56:41,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754123469] [2019-11-28 16:56:41,083 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-28 16:56:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:41,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 16:56:41,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:41,154 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-28 16:56:41,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,159 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:56:41,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,179 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-28 16:56:41,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,196 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-28 16:56:41,197 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,208 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-28 16:56:41,237 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:56:41,238 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-28 16:56:41,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,245 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-28 16:56:41,269 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-28 16:56:41,271 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,280 INFO L534 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-28 16:56:41,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 16:56:41,332 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-28 16:56:41,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:41,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:41,340 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 16:56:41,343 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-28 16:56:41,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:41,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 16:56:41,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109548802] [2019-11-28 16:56:41,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:56:41,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:56:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:56:41,347 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 10 states. [2019-11-28 16:56:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:41,681 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-11-28 16:56:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:56:41,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 16:56:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:41,683 INFO L225 Difference]: With dead ends: 59 [2019-11-28 16:56:41,683 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 16:56:41,684 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-28 16:56:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 16:56:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2019-11-28 16:56:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 16:56:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-28 16:56:41,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2019-11-28 16:56:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:41,691 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-28 16:56:41,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:56:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-28 16:56:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:56:41,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:41,693 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-28 16:56:41,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:41,895 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash 750661987, now seen corresponding path program 1 times [2019-11-28 16:56:41,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:41,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851064757] [2019-11-28 16:56:41,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:42,076 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-28 16:56:42,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851064757] [2019-11-28 16:56:42,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395219709] [2019-11-28 16:56:42,078 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-28 16:56:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:42,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 16:56:42,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:42,139 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-28 16:56:42,139 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:56:42,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,217 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-28 16:56:42,217 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,224 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-28 16:56:42,252 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-28 16:56:42,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,269 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-28 16:56:42,270 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,282 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,282 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-28 16:56:42,322 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|]} [2019-11-28 16:56:42,328 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-28 16:56:42,328 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,366 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-28 16:56:42,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:56:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:42,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:42,373 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-28 16:56:42,431 INFO L614 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-28 16:56:42,437 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-28 16:56:42,437 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,450 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-28 16:56:42,495 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-28 16:56:42,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,512 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-28 16:56:42,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,520 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-28 16:56:42,524 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-28 16:56:42,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:42,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:42,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 16:56:42,530 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-28 16:56:42,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:42,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-28 16:56:42,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996887137] [2019-11-28 16:56:42,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:56:42,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:56:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:56:42,532 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2019-11-28 16:56:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:42,912 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-28 16:56:42,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:56:42,912 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-28 16:56:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:42,913 INFO L225 Difference]: With dead ends: 63 [2019-11-28 16:56:42,913 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 16:56:42,914 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-28 16:56:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 16:56:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-28 16:56:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 16:56:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-11-28 16:56:42,919 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2019-11-28 16:56:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:42,920 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-28 16:56:42,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:56:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-11-28 16:56:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:56:42,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:42,921 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-28 16:56:43,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:43,126 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -119659938, now seen corresponding path program 1 times [2019-11-28 16:56:43,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:43,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187510914] [2019-11-28 16:56:43,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:43,292 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-28 16:56:43,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187510914] [2019-11-28 16:56:43,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525925537] [2019-11-28 16:56:43,293 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-28 16:56:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:43,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 16:56:43,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:43,363 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-28 16:56:43,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 16:56:43,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,414 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-28 16:56:43,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-28 16:56:43,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:43,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,489 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-28 16:56:43,489 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,510 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-28 16:56:43,540 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-28 16:56:43,546 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-28 16:56:43,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,588 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-28 16:56:43,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:56:43,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:43,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:43,593 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-28 16:56:43,630 INFO L614 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-28 16:56:43,636 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-28 16:56:43,636 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,644 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-28 16:56:43,697 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-28 16:56:43,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,711 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-28 16:56:43,712 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,718 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-28 16:56:43,724 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-28 16:56:43,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,726 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 16:56:43,729 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-28 16:56:43,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:43,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-28 16:56:43,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762741012] [2019-11-28 16:56:43,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:56:43,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:56:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:56:43,731 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 14 states. [2019-11-28 16:56:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:44,069 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-28 16:56:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:56:44,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-28 16:56:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:44,070 INFO L225 Difference]: With dead ends: 65 [2019-11-28 16:56:44,070 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 16:56:44,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 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-28 16:56:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 16:56:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-28 16:56:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 16:56:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-28 16:56:44,076 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2019-11-28 16:56:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:44,076 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-28 16:56:44,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:56:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-28 16:56:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:56:44,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:44,078 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-28 16:56:44,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:44,281 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash 905043038, now seen corresponding path program 2 times [2019-11-28 16:56:44,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:44,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801895920] [2019-11-28 16:56:44,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:44,416 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-28 16:56:44,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801895920] [2019-11-28 16:56:44,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822632732] [2019-11-28 16:56:44,417 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-28 16:56:44,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:56:44,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:56:44,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 16:56:44,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:44,485 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-28 16:56:44,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:56:44,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,512 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-28 16:56:44,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,520 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,521 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-28 16:56:44,534 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-28 16:56:44,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 16:56:44,562 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,586 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-28 16:56:44,603 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2019-11-28 16:56:44,610 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-28 16:56:44,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,645 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-28 16:56:44,646 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,688 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-28 16:56:44,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:56:44,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:44,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:44,691 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-28 16:56:44,715 INFO L614 ElimStorePlain]: treesize reduction 77, result has 26.0 percent of original size [2019-11-28 16:56:44,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,716 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-28 16:56:44,743 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-28 16:56:44,743 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,752 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-28 16:56:44,753 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,760 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-28 16:56:44,765 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-28 16:56:44,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,767 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 16:56:44,770 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-28 16:56:44,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:44,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-28 16:56:44,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60434074] [2019-11-28 16:56:44,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:56:44,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:56:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:56:44,772 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 10 states. [2019-11-28 16:56:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:45,041 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-11-28 16:56:45,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:56:45,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-28 16:56:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:45,043 INFO L225 Difference]: With dead ends: 58 [2019-11-28 16:56:45,043 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 16:56:45,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:56:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 16:56:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-11-28 16:56:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 16:56:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-28 16:56:45,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2019-11-28 16:56:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:45,048 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-28 16:56:45,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:56:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-28 16:56:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:56:45,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:45,049 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-28 16:56:45,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:45,253 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -719006641, now seen corresponding path program 2 times [2019-11-28 16:56:45,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:45,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653466123] [2019-11-28 16:56:45,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:45,492 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-28 16:56:45,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653466123] [2019-11-28 16:56:45,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864858658] [2019-11-28 16:56:45,493 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-28 16:56:45,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:56:45,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:56:45,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 16:56:45,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:45,581 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-28 16:56:45,582 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:56:45,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,616 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-28 16:56:45,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,677 INFO L614 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-28 16:56:45,687 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-28 16:56:45,688 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,701 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-28 16:56:45,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:45,749 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-28 16:56:45,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-28 16:56:45,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,811 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-28 16:56:45,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,833 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-28 16:56:45,834 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,848 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-28 16:56:45,903 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:56:45,904 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-28 16:56:45,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,932 INFO L534 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-28 16:56:45,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-28 16:56:45,977 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-28 16:56:45,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,994 INFO L534 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-28 16:56:45,994 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-28 16:56:46,072 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-28 16:56:46,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:46,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-28 16:56:46,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939486891] [2019-11-28 16:56:46,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 16:56:46,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 16:56:46,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:56:46,074 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 18 states. [2019-11-28 16:56:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:46,773 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-11-28 16:56:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 16:56:46,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-28 16:56:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:46,775 INFO L225 Difference]: With dead ends: 77 [2019-11-28 16:56:46,775 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 16:56:46,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:56:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 16:56:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-11-28 16:56:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 16:56:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-28 16:56:46,782 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2019-11-28 16:56:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:46,782 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-28 16:56:46,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 16:56:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-11-28 16:56:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:56:46,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:46,783 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-28 16:56:46,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:46,989 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -419304689, now seen corresponding path program 1 times [2019-11-28 16:56:46,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:46,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422182967] [2019-11-28 16:56:46,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:47,206 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-28 16:56:47,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422182967] [2019-11-28 16:56:47,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57359346] [2019-11-28 16:56:47,207 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-28 16:56:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:47,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 16:56:47,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:47,276 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-28 16:56:47,277 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,294 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:56:47,324 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,325 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-28 16:56:47,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,341 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-28 16:56:47,342 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,352 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,352 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-28 16:56:47,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:47,362 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-28 16:56:47,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,370 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-28 16:56:47,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:47,411 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-28 16:56:47,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,422 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-28 16:56:47,467 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 16:56:47,467 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-28 16:56:47,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,478 INFO L534 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-28 16:56:47,479 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-28 16:56:47,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,547 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-28 16:56:47,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,596 INFO L614 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-28 16:56:47,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,599 INFO L534 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-28 16:56:47,600 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-28 16:56:47,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,866 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-28 16:56:47,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,871 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,871 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-28 16:56:47,875 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-28 16:56:47,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:47,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-28 16:56:47,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590666658] [2019-11-28 16:56:47,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 16:56:47,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 16:56:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-28 16:56:47,877 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 17 states. [2019-11-28 16:56:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:48,847 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-11-28 16:56:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 16:56:48,847 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-28 16:56:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:48,848 INFO L225 Difference]: With dead ends: 95 [2019-11-28 16:56:48,849 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 16:56:48,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 16:56:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 16:56:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2019-11-28 16:56:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 16:56:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-11-28 16:56:48,855 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 24 [2019-11-28 16:56:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:48,856 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-11-28 16:56:48,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 16:56:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-11-28 16:56:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:56:48,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:48,857 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-28 16:56:49,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:49,065 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1597731914, now seen corresponding path program 3 times [2019-11-28 16:56:49,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:49,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747467410] [2019-11-28 16:56:49,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:49,354 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-28 16:56:49,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747467410] [2019-11-28 16:56:49,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264107501] [2019-11-28 16:56:49,355 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-28 16:56:49,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 16:56:49,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:56:49,419 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-28 16:56:49,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:49,431 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-28 16:56:49,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,436 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:56:49,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,474 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-28 16:56:49,474 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,504 INFO L614 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-28 16:56:49,505 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,505 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-28 16:56:49,558 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-28 16:56:49,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,581 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-28 16:56:49,581 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,599 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-28 16:56:49,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,657 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-28 16:56:49,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,692 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 2=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_21|]} [2019-11-28 16:56:49,698 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-28 16:56:49,699 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,743 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-28 16:56:49,743 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,776 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-28 16:56:49,777 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,798 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:40 [2019-11-28 16:56:49,864 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_22|]} [2019-11-28 16:56:49,870 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-28 16:56:49,871 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,916 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-28 16:56:49,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:49,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:49,918 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,964 INFO L614 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-28 16:56:49,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,971 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-28 16:56:49,972 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,993 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:61 [2019-11-28 16:56:50,038 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|, |v_#memory_$Pointer$.offset_23|], 5=[|v_#memory_$Pointer$.base_27|]} [2019-11-28 16:56:50,054 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-28 16:56:50,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,085 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-28 16:56:50,085 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,149 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-28 16:56:50,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:56:50,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,155 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-28 16:56:50,213 INFO L614 ElimStorePlain]: treesize reduction 291, result has 18.3 percent of original size [2019-11-28 16:56:50,214 INFO L534 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-28 16:56:50,214 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2019-11-28 16:56:50,268 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[|#memory_$Pointer$.base|]} [2019-11-28 16:56:50,272 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-28 16:56:50,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,296 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-28 16:56:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,299 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:50,326 INFO L614 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-11-28 16:56:50,327 INFO L534 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-28 16:56:50,328 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-28 16:56:50,429 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-28 16:56:50,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:50,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-11-28 16:56:50,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378231603] [2019-11-28 16:56:50,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 16:56:50,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 16:56:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-28 16:56:50,431 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 19 states. [2019-11-28 16:56:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:51,212 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-28 16:56:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 16:56:51,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-28 16:56:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:51,215 INFO L225 Difference]: With dead ends: 88 [2019-11-28 16:56:51,215 INFO L226 Difference]: Without dead ends: 82 [2019-11-28 16:56:51,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-28 16:56:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-28 16:56:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2019-11-28 16:56:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 16:56:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-28 16:56:51,223 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 26 [2019-11-28 16:56:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:51,223 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-28 16:56:51,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 16:56:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-11-28 16:56:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:56:51,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:51,224 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-28 16:56:51,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:51,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 823795978, now seen corresponding path program 1 times [2019-11-28 16:56:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:51,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888740919] [2019-11-28 16:56:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:56:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:56:51,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:56:51,491 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:56:51,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:56:51 BoogieIcfgContainer [2019-11-28 16:56:51,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:56:51,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:56:51,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:56:51,531 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:56:51,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:38" (3/4) ... [2019-11-28 16:56:51,534 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:56:51,590 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:56:51,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:56:51,592 INFO L168 Benchmark]: Toolchain (without parser) took 13895.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 135.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:51,592 INFO L168 Benchmark]: CDTParser took 0.85 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-28 16:56:51,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:51,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.07 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:51,593 INFO L168 Benchmark]: Boogie Preprocessor took 47.39 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-28 16:56:51,595 INFO L168 Benchmark]: RCFGBuilder took 443.72 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.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:51,595 INFO L168 Benchmark]: TraceAbstraction took 12688.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:51,595 INFO L168 Benchmark]: Witness Printer took 59.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:56:51,598 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.85 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 592.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.07 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.39 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 443.72 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.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12688.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.1 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.81 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. 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: 12.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 223 SDtfs, 651 SDslu, 1153 SDs, 0 SdLazy, 1853 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 152 SyntacticMatches, 15 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 4.0s 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, 5.2s 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...