./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.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/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:58:24,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:58:24,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:58:24,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:58:24,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:58:24,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:58:24,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:58:24,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:58:24,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:58:24,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:58:24,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:58:24,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:58:24,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:58:24,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:58:24,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:58:24,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:58:24,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:58:24,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:58:24,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:58:24,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:58:24,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:58:24,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:58:24,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:58:24,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:58:24,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:58:24,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:58:24,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:58:24,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:58:24,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:58:24,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:58:24,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:58:24,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:58:24,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:58:24,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:58:24,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:58:24,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:58:24,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:58:24,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:58:24,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:58:24,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:58:24,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:58:24,667 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:58:24,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:58:24,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:58:24,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:58:24,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:58:24,688 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:58:24,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:58:24,689 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:58:24,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:58:24,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:58:24,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:58:24,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:58:24,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:58:24,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:58:24,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:58:24,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:58:24,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:58:24,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:58:24,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:58:24,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:58:24,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:58:24,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:58:24,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:58:24,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:58:24,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:58:24,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:58:24,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:58:24,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:58:24,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:58:24,697 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:58:24,697 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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-11-28 16:58:25,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:58:25,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:58:25,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:58:25,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:58:25,040 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:58:25,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-28 16:58:25,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be56fda9/2ececb82132e49a9895dd84da8567267/FLAG05adb8e74 [2019-11-28 16:58:25,690 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:58:25,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-28 16:58:25,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be56fda9/2ececb82132e49a9895dd84da8567267/FLAG05adb8e74 [2019-11-28 16:58:26,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0be56fda9/2ececb82132e49a9895dd84da8567267 [2019-11-28 16:58:26,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:58:26,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:58:26,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:58:26,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:58:26,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:58:26,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b836fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26, skipping insertion in model container [2019-11-28 16:58:26,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:58:26,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:58:26,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:58:26,533 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:58:26,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:58:26,642 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:58:26,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26 WrapperNode [2019-11-28 16:58:26,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:58:26,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:58:26,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:58:26,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:58:26,655 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:58:26" (1/1) ... [2019-11-28 16:58:26,678 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:58:26" (1/1) ... [2019-11-28 16:58:26,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:58:26,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:58:26,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:58:26,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:58:26,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (1/1) ... [2019-11-28 16:58:26,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:58:26,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:58:26,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:58:26,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:58:26,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (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:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:58:26,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:58:27,370 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:58:27,370 INFO L287 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-28 16:58:27,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:58:27 BoogieIcfgContainer [2019-11-28 16:58:27,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:58:27,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:58:27,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:58:27,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:58:27,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:58:26" (1/3) ... [2019-11-28 16:58:27,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:58:27, skipping insertion in model container [2019-11-28 16:58:27,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:26" (2/3) ... [2019-11-28 16:58:27,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7100d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:58:27, skipping insertion in model container [2019-11-28 16:58:27,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:58:27" (3/3) ... [2019-11-28 16:58:27,380 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-11-28 16:58:27,391 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:58:27,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-28 16:58:27,410 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-28 16:58:27,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:58:27,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:58:27,433 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:58:27,433 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:58:27,434 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:58:27,434 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:58:27,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:58:27,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:58:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-28 16:58:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 16:58:27,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:27,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 16:58:27,459 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-11-28 16:58:27,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:27,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997935740] [2019-11-28 16:58:27,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:27,633 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:58:27,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997935740] [2019-11-28 16:58:27,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:27,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:58:27,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408079385] [2019-11-28 16:58:27,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:58:27,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:58:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:58:27,653 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-28 16:58:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:27,676 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-11-28 16:58:27,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:58:27,678 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 16:58:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:27,689 INFO L225 Difference]: With dead ends: 92 [2019-11-28 16:58:27,689 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 16:58:27,693 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:58:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 16:58:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 16:58:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 16:58:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-11-28 16:58:27,734 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-11-28 16:58:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:27,734 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-11-28 16:58:27,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:58:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-11-28 16:58:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 16:58:27,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:27,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:27,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:27,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:27,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-11-28 16:58:27,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:27,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849638328] [2019-11-28 16:58:27,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:27,886 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:58:27,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849638328] [2019-11-28 16:58:27,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:27,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:58:27,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146004922] [2019-11-28 16:58:27,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:58:27,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:58:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:27,893 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-11-28 16:58:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:28,020 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-11-28 16:58:28,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:58:28,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 16:58:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:28,023 INFO L225 Difference]: With dead ends: 47 [2019-11-28 16:58:28,023 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 16:58:28,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:58:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 16:58:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-28 16:58:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 16:58:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 16:58:28,038 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-11-28 16:58:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:28,039 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 16:58:28,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:58:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 16:58:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 16:58:28,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:28,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:28,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-11-28 16:58:28,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:28,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126231316] [2019-11-28 16:58:28,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:28,181 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:58:28,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126231316] [2019-11-28 16:58:28,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:28,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:58:28,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725866316] [2019-11-28 16:58:28,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:58:28,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:28,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:58:28,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:28,186 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-28 16:58:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:28,277 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-28 16:58:28,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:58:28,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 16:58:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:28,279 INFO L225 Difference]: With dead ends: 39 [2019-11-28 16:58:28,279 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 16:58:28,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:58:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 16:58:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 16:58:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 16:58:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-28 16:58:28,286 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-11-28 16:58:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:28,286 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-28 16:58:28,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:58:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-28 16:58:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:58:28,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:28,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:28,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-11-28 16:58:28,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:28,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579243099] [2019-11-28 16:58:28,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:28,471 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:58:28,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579243099] [2019-11-28 16:58:28,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:28,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 16:58:28,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503096421] [2019-11-28 16:58:28,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:58:28,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:58:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:58:28,473 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-11-28 16:58:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:28,798 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-11-28 16:58:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:58:28,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 16:58:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:28,800 INFO L225 Difference]: With dead ends: 78 [2019-11-28 16:58:28,801 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 16:58:28,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:58:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 16:58:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-11-28 16:58:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 16:58:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-28 16:58:28,812 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-11-28 16:58:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:28,812 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-28 16:58:28,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:58:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-28 16:58:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:58:28,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:28,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:28,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-11-28 16:58:28,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:28,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798534166] [2019-11-28 16:58:28,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:28,936 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:58:28,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798534166] [2019-11-28 16:58:28,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:28,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:58:28,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178261277] [2019-11-28 16:58:28,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:58:28,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:58:28,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:28,939 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-11-28 16:58:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:29,081 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-28 16:58:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:58:29,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 16:58:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:29,082 INFO L225 Difference]: With dead ends: 55 [2019-11-28 16:58:29,083 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 16:58:29,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:58:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 16:58:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 16:58:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 16:58:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-28 16:58:29,091 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-11-28 16:58:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:29,091 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-28 16:58:29,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:58:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-28 16:58:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 16:58:29,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:29,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:29,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-11-28 16:58:29,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:29,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573994175] [2019-11-28 16:58:29,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:29,190 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:58:29,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573994175] [2019-11-28 16:58:29,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:29,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:58:29,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889244662] [2019-11-28 16:58:29,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:58:29,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:58:29,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:29,194 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-11-28 16:58:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:29,291 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-28 16:58:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:58:29,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 16:58:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:29,292 INFO L225 Difference]: With dead ends: 53 [2019-11-28 16:58:29,293 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 16:58:29,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:58:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 16:58:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 16:58:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 16:58:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-28 16:58:29,300 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-11-28 16:58:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:29,301 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-28 16:58:29,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:58:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-28 16:58:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:58:29,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:29,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:29,303 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-11-28 16:58:29,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:29,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804680585] [2019-11-28 16:58:29,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:29,408 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:58:29,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804680585] [2019-11-28 16:58:29,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:29,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:58:29,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686713678] [2019-11-28 16:58:29,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:58:29,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:29,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:58:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:58:29,411 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-28 16:58:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:29,558 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-11-28 16:58:29,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:58:29,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 16:58:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:29,560 INFO L225 Difference]: With dead ends: 66 [2019-11-28 16:58:29,560 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 16:58:29,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:58:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 16:58:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-28 16:58:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 16:58:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-28 16:58:29,568 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-11-28 16:58:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:29,569 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-28 16:58:29,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:58:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-28 16:58:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 16:58:29,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:29,571 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:29,572 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:29,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-11-28 16:58:29,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:29,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192448339] [2019-11-28 16:58:29,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:58:29,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192448339] [2019-11-28 16:58:29,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573370973] [2019-11-28 16:58:29,649 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:58:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:29,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 16:58:29,732 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:58:29,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-28 16:58:29,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:29,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:29,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-28 16:58:29,840 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:29,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:29,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:29,858 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-11-28 16:58:29,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:29,914 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 24 treesize of output 10 [2019-11-28 16:58:29,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:29,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:29,932 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 16:58:29,932 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-28 16:58:29,933 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:29,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:29,941 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:58:29,941 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-28 16:58:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:58:29,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:58:29,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 16:58:29,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150690959] [2019-11-28 16:58:29,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 16:58:29,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 16:58:29,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:58:29,950 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 7 states. [2019-11-28 16:58:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:30,150 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-28 16:58:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:58:30,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 16:58:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:30,151 INFO L225 Difference]: With dead ends: 75 [2019-11-28 16:58:30,151 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 16:58:30,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:58:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 16:58:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 16:58:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 16:58:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-28 16:58:30,166 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2019-11-28 16:58:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:30,166 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-28 16:58:30,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 16:58:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-28 16:58:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:58:30,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:30,170 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:30,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:58:30,377 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-11-28 16:58:30,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:30,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720986185] [2019-11-28 16:58:30,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:30,706 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:58:30,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720986185] [2019-11-28 16:58:30,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499267075] [2019-11-28 16:58:30,708 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:58:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:30,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 16:58:30,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:58:30,841 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 16:58:30,841 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 16:58:30,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:30,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:30,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:58:30,863 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:30,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:30,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:30,879 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-28 16:58:30,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:30,999 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:58:31,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,074 INFO L614 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-11-28 16:58:31,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:31,091 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,135 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:31,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,170 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:31,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:31,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,228 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 1 case distinctions, treesize of input 77 treesize of output 55 [2019-11-28 16:58:31,229 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,274 INFO L614 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-11-28 16:58:31,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,276 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-11-28 16:58:31,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,331 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:58:31,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,381 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_int_37|, |v_#memory_int_38|, |v_#memory_int_39|], 4=[|v_#memory_int_41|]} [2019-11-28 16:58:31,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:31,386 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,433 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:31,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,475 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:31,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,513 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:31,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:31,590 INFO L343 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-11-28 16:58:31,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2019-11-28 16:58:31,593 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,645 INFO L614 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-11-28 16:58:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:31,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:31,652 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-11-28 16:58:31,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-11-28 16:58:31,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:31,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:31,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-28 16:58:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:58:31,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:58:31,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-28 16:58:31,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038447288] [2019-11-28 16:58:31,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 16:58:31,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:31,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 16:58:31,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:58:31,765 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 12 states. [2019-11-28 16:58:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:32,499 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-28 16:58:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:58:32,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 16:58:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:32,505 INFO L225 Difference]: With dead ends: 85 [2019-11-28 16:58:32,505 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 16:58:32,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-28 16:58:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 16:58:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 35. [2019-11-28 16:58:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 16:58:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-28 16:58:32,519 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2019-11-28 16:58:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:32,519 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-28 16:58:32,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 16:58:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-28 16:58:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 16:58:32,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:32,521 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:32,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:58:32,725 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2019-11-28 16:58:32,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:32,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641408107] [2019-11-28 16:58:32,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:32,988 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:58:32,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641408107] [2019-11-28 16:58:32,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811771416] [2019-11-28 16:58:32,989 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:58:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:33,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-28 16:58:33,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:58:33,086 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 16:58:33,087 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 16:58:33,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:33,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,097 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:33,097 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-11-28 16:58:33,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,194 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:58:33,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:33,307 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-28 16:58:33,310 INFO L614 ElimStorePlain]: treesize reduction 14, result has 93.4 percent of original size [2019-11-28 16:58:33,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:33,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:33,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:58:33,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,337 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-28 16:58:33,338 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:33,407 INFO L614 ElimStorePlain]: treesize reduction 16, result has 89.2 percent of original size [2019-11-28 16:58:33,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:33,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2019-11-28 16:58:33,435 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:33,494 INFO L614 ElimStorePlain]: treesize reduction 24, result has 73.3 percent of original size [2019-11-28 16:58:33,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:33,496 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:63 [2019-11-28 16:58:33,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,606 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:58:33,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:33,823 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 16:58:33,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,827 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|], 11=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_30|]} [2019-11-28 16:58:33,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:33,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 433 treesize of output 333 [2019-11-28 16:58:33,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:33,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:33,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:33,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:33,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:33,890 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-28 16:58:34,628 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-28 16:58:34,629 INFO L614 ElimStorePlain]: treesize reduction 3610, result has 10.4 percent of original size [2019-11-28 16:58:34,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-28 16:58:34,652 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:34,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:34,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:34,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:34,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:34,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:58:34,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:34,805 INFO L343 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-11-28 16:58:34,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2019-11-28 16:58:34,807 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:34,934 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-28 16:58:34,935 INFO L614 ElimStorePlain]: treesize reduction 41, result has 86.2 percent of original size [2019-11-28 16:58:34,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:34,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:35,142 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-28 16:58:35,143 INFO L343 Elim1Store]: treesize reduction 33, result has 82.0 percent of original size [2019-11-28 16:58:35,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 198 [2019-11-28 16:58:35,167 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:35,312 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-11-28 16:58:35,314 INFO L614 ElimStorePlain]: treesize reduction 168, result has 38.5 percent of original size [2019-11-28 16:58:35,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:35,316 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:454, output treesize:102 [2019-11-28 16:58:35,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:35,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 53 [2019-11-28 16:58:35,486 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:35,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:35,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:35,504 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:172, output treesize:88 [2019-11-28 16:58:35,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:35,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 122 [2019-11-28 16:58:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:58:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:35,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:35,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:35,627 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:58:35,627 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:4 [2019-11-28 16:58:35,641 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:58:35,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:58:35,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-28 16:58:35,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037499686] [2019-11-28 16:58:35,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:58:35,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:58:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:58:35,644 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-11-28 16:58:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:37,003 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-11-28 16:58:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 16:58:37,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-11-28 16:58:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:37,005 INFO L225 Difference]: With dead ends: 105 [2019-11-28 16:58:37,006 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 16:58:37,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-28 16:58:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 16:58:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2019-11-28 16:58:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 16:58:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-11-28 16:58:37,014 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 28 [2019-11-28 16:58:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:37,015 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-11-28 16:58:37,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:58:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-11-28 16:58:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 16:58:37,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:37,016 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:37,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:58:37,220 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:37,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1572363688, now seen corresponding path program 1 times [2019-11-28 16:58:37,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:37,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157540918] [2019-11-28 16:58:37,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:38,109 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:58:38,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157540918] [2019-11-28 16:58:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630163310] [2019-11-28 16:58:38,110 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:58:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:38,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 16:58:38,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:58:38,207 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 16:58:38,208 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 16:58:38,208 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:38,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-28 16:58:38,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,288 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:58:38,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:38,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:38,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:58:38,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,352 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 1 case distinctions, treesize of input 67 treesize of output 49 [2019-11-28 16:58:38,352 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,404 INFO L614 ElimStorePlain]: treesize reduction 22, result has 85.2 percent of original size [2019-11-28 16:58:38,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:38,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:38,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 51 [2019-11-28 16:58:38,443 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,492 INFO L614 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-28 16:58:38,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,494 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:203, output treesize:45 [2019-11-28 16:58:38,534 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|]} [2019-11-28 16:58:38,540 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 25 treesize of output 17 [2019-11-28 16:58:38,540 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,615 INFO L343 Elim1Store]: treesize reduction 74, result has 47.5 percent of original size [2019-11-28 16:58:38,616 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 153 [2019-11-28 16:58:38,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:38,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,661 INFO L614 ElimStorePlain]: treesize reduction 40, result has 71.2 percent of original size [2019-11-28 16:58:38,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 109 [2019-11-28 16:58:38,681 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,707 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.4 percent of original size [2019-11-28 16:58:38,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,707 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:60 [2019-11-28 16:58:38,821 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,821 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 67 treesize of output 58 [2019-11-28 16:58:38,822 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,835 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 16:58:38,836 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,840 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:58:38,840 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:9 [2019-11-28 16:58:38,868 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 19 treesize of output 7 [2019-11-28 16:58:38,869 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:38,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:38,871 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:58:38,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-28 16:58:38,900 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:58:38,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:58:38,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-11-28 16:58:38,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449351289] [2019-11-28 16:58:38,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 16:58:38,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 16:58:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-28 16:58:38,902 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 21 states. [2019-11-28 16:58:39,105 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-11-28 16:58:39,356 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-28 16:58:39,684 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-11-28 16:58:40,928 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-28 16:58:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:41,388 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-11-28 16:58:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 16:58:41,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-28 16:58:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:41,395 INFO L225 Difference]: With dead ends: 127 [2019-11-28 16:58:41,395 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 16:58:41,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 16:58:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 16:58:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2019-11-28 16:58:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 16:58:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-28 16:58:41,421 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 28 [2019-11-28 16:58:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:41,422 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-28 16:58:41,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 16:58:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-28 16:58:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 16:58:41,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:41,425 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:41,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:58:41,638 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash 120690651, now seen corresponding path program 2 times [2019-11-28 16:58:41,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:41,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948204504] [2019-11-28 16:58:41,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:58:41,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948204504] [2019-11-28 16:58:41,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646343177] [2019-11-28 16:58:41,886 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:58:41,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:58:41,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:58:41,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-28 16:58:41,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:58:41,990 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 16:58:41,990 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 16:58:41,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:42,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:42,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:42,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-28 16:58:42,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:42,086 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:58:42,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:42,214 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-28 16:58:42,215 INFO L614 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-11-28 16:58:42,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:42,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:58:42,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:42,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-28 16:58:42,240 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:42,318 INFO L614 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-11-28 16:58:42,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:42,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:42,338 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-28 16:58:42,338 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:42,396 INFO L614 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-28 16:58:42,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:42,398 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-11-28 16:58:42,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:42,536 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:58:42,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:42,990 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-28 16:58:42,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:42,993 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|, |v_#memory_int_46|], 2=[|v_#memory_int_44|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|], 11=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|]} [2019-11-28 16:58:43,004 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:58:43,360 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-28 16:58:43,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:43,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2019-11-28 16:58:43,470 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:43,773 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 16:58:43,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:43,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:43,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 29 [2019-11-28 16:58:43,828 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:44,042 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 16:58:44,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:44,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:44,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 138 [2019-11-28 16:58:44,093 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:44,605 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 16:58:44,608 INFO L614 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-11-28 16:58:44,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:44,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1047 treesize of output 635 [2019-11-28 16:58:44,618 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:44,878 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-28 16:58:44,879 INFO L614 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-11-28 16:58:44,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-28 16:58:44,904 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:45,031 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 16:58:45,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:45,267 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-28 16:58:45,267 INFO L343 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-11-28 16:58:45,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 535 treesize of output 537 [2019-11-28 16:58:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,285 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-11-28 16:58:45,481 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-11-28 16:58:45,481 INFO L614 ElimStorePlain]: treesize reduction 1789, result has 16.4 percent of original size [2019-11-28 16:58:45,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:45,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:45,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:45,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2019-11-28 16:58:45,501 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:45,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:45,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:58:45,534 INFO L239 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2019-11-28 16:58:45,640 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-11-28 16:58:45,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:45,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 78 [2019-11-28 16:58:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:58:45,658 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:45,700 INFO L614 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-11-28 16:58:45,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:58:45,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-11-28 16:58:45,707 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:45,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:45,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:58:45,716 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-11-28 16:58:45,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:58:45,747 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-28 16:58:45,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:58:45,758 INFO L614 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-28 16:58:45,758 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:58:45,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-28 16:58:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:58:45,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:58:45,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 16:58:45,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210675000] [2019-11-28 16:58:45,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:58:45,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:45,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:58:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:58:45,792 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 14 states. [2019-11-28 16:58:46,576 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-28 16:58:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:46,956 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-11-28 16:58:46,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 16:58:46,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-28 16:58:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:46,957 INFO L225 Difference]: With dead ends: 124 [2019-11-28 16:58:46,958 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 16:58:46,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:58:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 16:58:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2019-11-28 16:58:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 16:58:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2019-11-28 16:58:46,975 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 31 [2019-11-28 16:58:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:46,975 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2019-11-28 16:58:46,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:58:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2019-11-28 16:58:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 16:58:46,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:46,980 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:47,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:58:47,194 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:47,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -994395513, now seen corresponding path program 1 times [2019-11-28 16:58:47,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:47,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086764777] [2019-11-28 16:58:47,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:58:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:58:47,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:58:47,327 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:58:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:58:47 BoogieIcfgContainer [2019-11-28 16:58:47,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:58:47,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:58:47,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:58:47,384 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:58:47,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:58:27" (3/4) ... [2019-11-28 16:58:47,387 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:58:47,445 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:58:47,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:58:47,447 INFO L168 Benchmark]: Toolchain (without parser) took 21413.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 199.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:58:47,447 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:58:47,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:58:47,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:58:47,448 INFO L168 Benchmark]: Boogie Preprocessor took 38.26 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:58:47,449 INFO L168 Benchmark]: RCFGBuilder took 621.62 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:58:47,449 INFO L168 Benchmark]: TraceAbstraction took 20009.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -62.2 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:58:47,450 INFO L168 Benchmark]: Witness Printer took 62.32 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:58:47,451 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.81 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.26 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 621.62 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20009.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -62.2 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.32 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK [L1021] EXPR end->colour [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) [L1038] EXPR end->colour [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 7 error locations. Result: UNSAFE, OverallTime: 19.8s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 378 SDtfs, 907 SDslu, 1331 SDs, 0 SdLazy, 1565 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 302 ConstructedInterpolants, 29 QuantifiedInterpolants, 256038 SizeOfPredicates, 69 NumberOfNonLiveVariables, 607 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 12/42 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...