./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0b85db7f19d029ed27be7f6b92a191abc3110f8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-25 22:08:55,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:08:55,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:08:55,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:08:55,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:08:55,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:08:55,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:08:55,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:08:55,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:08:55,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:08:55,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:08:55,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:08:55,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:08:55,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:08:55,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:08:55,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:08:55,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:08:55,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:08:55,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:08:55,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:08:55,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:08:55,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:08:55,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:08:55,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:08:55,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:08:55,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:08:55,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:08:55,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:08:55,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:08:55,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:08:55,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:08:55,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:08:55,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:08:55,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:08:55,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:08:55,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:08:55,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:08:55,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:08:55,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:08:55,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:08:55,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:08:55,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:08:55,574 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:08:55,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:08:55,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:08:55,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:08:55,578 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:08:55,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:08:55,579 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:08:55,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:08:55,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:08:55,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:08:55,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:08:55,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:08:55,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:08:55,582 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:08:55,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:08:55,582 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:08:55,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:08:55,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:08:55,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:08:55,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:08:55,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:08:55,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:08:55,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:08:55,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:08:55,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:08:55,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:08:55,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:08:55,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:08:55,586 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:08:55,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> e0b85db7f19d029ed27be7f6b92a191abc3110f8 [2020-10-25 22:08:56,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:08:56,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:08:56,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:08:56,089 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:08:56,090 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:08:56,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-25 22:08:56,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a817f4112/ab456023d30345d98c9512d9d9baa231/FLAG0e825c5ac [2020-10-25 22:08:56,800 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:08:56,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-25 22:08:56,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a817f4112/ab456023d30345d98c9512d9d9baa231/FLAG0e825c5ac [2020-10-25 22:08:57,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a817f4112/ab456023d30345d98c9512d9d9baa231 [2020-10-25 22:08:57,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:08:57,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:08:57,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:08:57,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:08:57,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:08:57,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284f3623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57, skipping insertion in model container [2020-10-25 22:08:57,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:08:57,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:08:57,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:08:57,632 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:08:57,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:08:57,814 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:08:57,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57 WrapperNode [2020-10-25 22:08:57,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:08:57,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:08:57,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:08:57,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:08:57,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:08:57,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:08:57,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:08:57,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:08:57,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (1/1) ... [2020-10-25 22:08:57,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:08:57,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:08:57,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:08:57,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:08:57,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (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 [2020-10-25 22:08:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 22:08:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-25 22:08:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 22:08:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 22:08:58,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:08:58,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 22:08:58,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 22:08:58,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:08:58,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:08:58,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:08:58,825 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:08:58,825 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-25 22:08:58,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:08:58 BoogieIcfgContainer [2020-10-25 22:08:58,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:08:58,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:08:58,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:08:58,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:08:58,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:08:57" (1/3) ... [2020-10-25 22:08:58,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd6e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:08:58, skipping insertion in model container [2020-10-25 22:08:58,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:08:57" (2/3) ... [2020-10-25 22:08:58,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd6e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:08:58, skipping insertion in model container [2020-10-25 22:08:58,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:08:58" (3/3) ... [2020-10-25 22:08:58,844 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-10-25 22:08:58,856 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:08:58,862 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 22:08:58,875 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 22:08:58,900 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:08:58,900 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:08:58,901 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:08:58,901 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:08:58,901 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:08:58,901 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:08:58,902 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:08:58,902 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:08:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-10-25 22:08:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:08:58,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:08:58,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:08:58,926 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:08:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:08:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1416944146, now seen corresponding path program 1 times [2020-10-25 22:08:58,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:08:58,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081026424] [2020-10-25 22:08:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:08:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:08:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:08:59,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081026424] [2020-10-25 22:08:59,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:08:59,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 22:08:59,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354812292] [2020-10-25 22:08:59,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 22:08:59,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:08:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 22:08:59,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 22:08:59,117 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2020-10-25 22:08:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:08:59,142 INFO L93 Difference]: Finished difference Result 103 states and 163 transitions. [2020-10-25 22:08:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 22:08:59,144 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2020-10-25 22:08:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:08:59,153 INFO L225 Difference]: With dead ends: 103 [2020-10-25 22:08:59,154 INFO L226 Difference]: Without dead ends: 45 [2020-10-25 22:08:59,157 INFO L677 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 [2020-10-25 22:08:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-25 22:08:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-25 22:08:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:08:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-10-25 22:08:59,196 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2020-10-25 22:08:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:08:59,197 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-10-25 22:08:59,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 22:08:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-10-25 22:08:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 22:08:59,211 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:08:59,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:08:59,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:08:59,212 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:08:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:08:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1171444280, now seen corresponding path program 1 times [2020-10-25 22:08:59,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:08:59,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543604698] [2020-10-25 22:08:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:08:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:08:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:08:59,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543604698] [2020-10-25 22:08:59,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:08:59,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:08:59,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780739935] [2020-10-25 22:08:59,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:08:59,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:08:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:08:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:08:59,310 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 3 states. [2020-10-25 22:08:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:08:59,337 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-10-25 22:08:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:08:59,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-10-25 22:08:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:08:59,341 INFO L225 Difference]: With dead ends: 75 [2020-10-25 22:08:59,341 INFO L226 Difference]: Without dead ends: 53 [2020-10-25 22:08:59,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:08:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-25 22:08:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-25 22:08:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-25 22:08:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2020-10-25 22:08:59,352 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 23 [2020-10-25 22:08:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:08:59,353 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2020-10-25 22:08:59,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:08:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2020-10-25 22:08:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 22:08:59,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:08:59,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:08:59,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:08:59,355 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:08:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:08:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1613486293, now seen corresponding path program 1 times [2020-10-25 22:08:59,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:08:59,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115516743] [2020-10-25 22:08:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:08:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:08:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:08:59,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115516743] [2020-10-25 22:08:59,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:08:59,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 22:08:59,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042183816] [2020-10-25 22:08:59,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 22:08:59,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:08:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 22:08:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:08:59,412 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 3 states. [2020-10-25 22:08:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:08:59,437 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2020-10-25 22:08:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 22:08:59,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 22:08:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:08:59,439 INFO L225 Difference]: With dead ends: 93 [2020-10-25 22:08:59,439 INFO L226 Difference]: Without dead ends: 55 [2020-10-25 22:08:59,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 22:08:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-25 22:08:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-25 22:08:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-25 22:08:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2020-10-25 22:08:59,451 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 29 [2020-10-25 22:08:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:08:59,451 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-10-25 22:08:59,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 22:08:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-10-25 22:08:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 22:08:59,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:08:59,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:08:59,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:08:59,458 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:08:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:08:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1832341011, now seen corresponding path program 1 times [2020-10-25 22:08:59,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:08:59,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004287208] [2020-10-25 22:08:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:08:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:08:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:08:59,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004287208] [2020-10-25 22:08:59,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:08:59,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:08:59,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086133178] [2020-10-25 22:08:59,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:08:59,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:08:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:08:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:08:59,629 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 5 states. [2020-10-25 22:08:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:08:59,770 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-10-25 22:08:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:08:59,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-10-25 22:08:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:08:59,773 INFO L225 Difference]: With dead ends: 84 [2020-10-25 22:08:59,773 INFO L226 Difference]: Without dead ends: 78 [2020-10-25 22:08:59,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:08:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-25 22:08:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2020-10-25 22:08:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-25 22:08:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2020-10-25 22:08:59,783 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 29 [2020-10-25 22:08:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:08:59,784 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2020-10-25 22:08:59,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:08:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2020-10-25 22:08:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-25 22:08:59,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:08:59,786 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:08:59,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:08:59,786 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:08:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:08:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash -526312690, now seen corresponding path program 1 times [2020-10-25 22:08:59,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:08:59,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223190478] [2020-10-25 22:08:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:08:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:08:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:08:59,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223190478] [2020-10-25 22:08:59,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:08:59,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:08:59,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291952137] [2020-10-25 22:08:59,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:08:59,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:08:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:08:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:08:59,861 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand 5 states. [2020-10-25 22:08:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:08:59,993 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-10-25 22:08:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:08:59,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-10-25 22:08:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:08:59,995 INFO L225 Difference]: With dead ends: 86 [2020-10-25 22:08:59,995 INFO L226 Difference]: Without dead ends: 76 [2020-10-25 22:08:59,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:08:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-25 22:09:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2020-10-25 22:09:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-25 22:09:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2020-10-25 22:09:00,004 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 31 [2020-10-25 22:09:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:00,004 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2020-10-25 22:09:00,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:09:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2020-10-25 22:09:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-25 22:09:00,006 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:00,006 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:00,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:09:00,007 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 665736462, now seen corresponding path program 1 times [2020-10-25 22:09:00,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:00,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085894566] [2020-10-25 22:09:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:00,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085894566] [2020-10-25 22:09:00,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:09:00,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:09:00,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229320786] [2020-10-25 22:09:00,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:09:00,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:09:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:09:00,072 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand 5 states. [2020-10-25 22:09:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:00,197 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-10-25 22:09:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:09:00,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-10-25 22:09:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:00,199 INFO L225 Difference]: With dead ends: 86 [2020-10-25 22:09:00,199 INFO L226 Difference]: Without dead ends: 73 [2020-10-25 22:09:00,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:09:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-25 22:09:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2020-10-25 22:09:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-25 22:09:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2020-10-25 22:09:00,207 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2020-10-25 22:09:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:00,208 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2020-10-25 22:09:00,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:09:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-10-25 22:09:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 22:09:00,209 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:00,210 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:00,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:09:00,210 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:00,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1093383942, now seen corresponding path program 1 times [2020-10-25 22:09:00,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:00,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249155606] [2020-10-25 22:09:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:00,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249155606] [2020-10-25 22:09:00,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884401118] [2020-10-25 22:09:00,436 INFO L95 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 [2020-10-25 22:09:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:00,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-25 22:09:00,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:00,672 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:00,672 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-25 22:09:00,714 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,715 INFO L384 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 [2020-10-25 22:09:00,716 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,730 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:00,731 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,740 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,740 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-10-25 22:09:00,772 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:00,773 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-25 22:09:00,774 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,780 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,780 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-10-25 22:09:00,804 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-25 22:09:00,805 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:00,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-25 22:09:00,870 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-25 22:09:00,872 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:00,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:00,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-25 22:09:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:00,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:00,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-25 22:09:00,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880811203] [2020-10-25 22:09:00,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:09:00,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:09:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:09:00,888 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 9 states. [2020-10-25 22:09:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:01,176 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2020-10-25 22:09:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:09:01,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-10-25 22:09:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:01,178 INFO L225 Difference]: With dead ends: 88 [2020-10-25 22:09:01,178 INFO L226 Difference]: Without dead ends: 80 [2020-10-25 22:09:01,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:09:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-25 22:09:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2020-10-25 22:09:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-25 22:09:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2020-10-25 22:09:01,186 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 33 [2020-10-25 22:09:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:01,186 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2020-10-25 22:09:01,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:09:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2020-10-25 22:09:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-25 22:09:01,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:01,188 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:01,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 22:09:01,403 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:01,404 INFO L82 PathProgramCache]: Analyzing trace with hash -293072966, now seen corresponding path program 1 times [2020-10-25 22:09:01,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:01,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091157658] [2020-10-25 22:09:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:01,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091157658] [2020-10-25 22:09:01,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837871311] [2020-10-25 22:09:01,575 INFO L95 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 [2020-10-25 22:09:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:01,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-25 22:09:01,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:01,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:01,705 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-25 22:09:01,734 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,735 INFO L384 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 [2020-10-25 22:09:01,736 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,753 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:01,753 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,763 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,764 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-10-25 22:09:01,784 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:01,785 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-25 22:09:01,785 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,792 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,793 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,793 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-10-25 22:09:01,808 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-25 22:09:01,809 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:01,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-25 22:09:01,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-25 22:09:01,874 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:01,881 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:01,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-25 22:09:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:01,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:01,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-25 22:09:01,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028243956] [2020-10-25 22:09:01,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 22:09:01,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 22:09:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:09:01,890 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand 9 states. [2020-10-25 22:09:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:02,283 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2020-10-25 22:09:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-25 22:09:02,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-10-25 22:09:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:02,284 INFO L225 Difference]: With dead ends: 97 [2020-10-25 22:09:02,285 INFO L226 Difference]: Without dead ends: 91 [2020-10-25 22:09:02,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:09:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-25 22:09:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2020-10-25 22:09:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-25 22:09:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2020-10-25 22:09:02,302 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 33 [2020-10-25 22:09:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:02,303 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2020-10-25 22:09:02,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 22:09:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2020-10-25 22:09:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-25 22:09:02,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:02,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:02,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:02,520 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:02,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2047331787, now seen corresponding path program 1 times [2020-10-25 22:09:02,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:02,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937722385] [2020-10-25 22:09:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:02,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937722385] [2020-10-25 22:09:02,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641048518] [2020-10-25 22:09:02,868 INFO L95 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 [2020-10-25 22:09:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:02,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-25 22:09:02,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:02,994 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:02,995 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:02,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:02,997 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:02,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-25 22:09:03,041 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,041 INFO L384 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 [2020-10-25 22:09:03,042 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,049 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,049 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-25 22:09:03,096 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-25 22:09:03,096 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,114 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-25 22:09:03,114 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,130 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-10-25 22:09:03,178 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2020-10-25 22:09:03,188 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-10-25 22:09:03,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,240 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2020-10-25 22:09:03,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-10-25 22:09:03,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-25 22:09:03,246 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,270 INFO L625 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-10-25 22:09:03,277 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2020-10-25 22:09:03,278 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,286 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,286 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,286 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-10-25 22:09:03,327 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-10-25 22:09:03,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,339 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-25 22:09:03,339 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,349 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,350 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-10-25 22:09:03,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-25 22:09:03,360 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:03,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:03,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-25 22:09:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:03,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:03,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-10-25 22:09:03,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300962763] [2020-10-25 22:09:03,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-25 22:09:03,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-25 22:09:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-25 22:09:03,369 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand 14 states. [2020-10-25 22:09:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:03,987 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2020-10-25 22:09:03,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:09:03,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-10-25 22:09:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:03,991 INFO L225 Difference]: With dead ends: 101 [2020-10-25 22:09:03,992 INFO L226 Difference]: Without dead ends: 95 [2020-10-25 22:09:03,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:09:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-25 22:09:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2020-10-25 22:09:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-25 22:09:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2020-10-25 22:09:04,009 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 35 [2020-10-25 22:09:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:04,009 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2020-10-25 22:09:04,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-25 22:09:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2020-10-25 22:09:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 22:09:04,011 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:04,011 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:04,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:04,212 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash -860258640, now seen corresponding path program 1 times [2020-10-25 22:09:04,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:04,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616522931] [2020-10-25 22:09:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:04,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616522931] [2020-10-25 22:09:04,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810127996] [2020-10-25 22:09:04,507 INFO L95 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 [2020-10-25 22:09:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:04,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-25 22:09:04,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:04,631 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:04,631 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,642 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,642 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-25 22:09:04,685 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,686 INFO L384 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 [2020-10-25 22:09:04,687 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,694 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,694 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-25 22:09:04,723 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-25 22:09:04,723 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,742 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-25 22:09:04,742 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,766 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,766 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-10-25 22:09:04,801 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_45|]} [2020-10-25 22:09:04,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-10-25 22:09:04,807 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,821 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,825 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2020-10-25 22:09:04,826 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,860 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2020-10-25 22:09:04,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-10-25 22:09:04,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 22:09:04,866 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,889 INFO L625 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2020-10-25 22:09:04,890 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,890 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-10-25 22:09:04,943 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-10-25 22:09:04,944 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,958 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-25 22:09:04,959 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,964 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-10-25 22:09:04,973 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-25 22:09:04,974 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:04,977 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:04,977 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-25 22:09:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:05,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:05,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-10-25 22:09:05,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199578048] [2020-10-25 22:09:05,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 22:09:05,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 22:09:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-25 22:09:05,012 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand 15 states. [2020-10-25 22:09:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:05,581 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2020-10-25 22:09:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:09:05,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-10-25 22:09:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:05,584 INFO L225 Difference]: With dead ends: 103 [2020-10-25 22:09:05,584 INFO L226 Difference]: Without dead ends: 91 [2020-10-25 22:09:05,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-10-25 22:09:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-25 22:09:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2020-10-25 22:09:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-25 22:09:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2020-10-25 22:09:05,596 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 37 [2020-10-25 22:09:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:05,598 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2020-10-25 22:09:05,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 22:09:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2020-10-25 22:09:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 22:09:05,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:05,606 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:05,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:05,822 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 331790512, now seen corresponding path program 2 times [2020-10-25 22:09:05,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:05,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114841209] [2020-10-25 22:09:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:06,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114841209] [2020-10-25 22:09:06,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184616089] [2020-10-25 22:09:06,078 INFO L93 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 [2020-10-25 22:09:06,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 22:09:06,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:09:06,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 36 conjunts are in the unsatisfiable core [2020-10-25 22:09:06,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:06,192 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:06,193 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,200 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-25 22:09:06,234 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,234 INFO L384 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 [2020-10-25 22:09:06,235 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,244 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,244 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-10-25 22:09:06,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:06,256 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,281 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:06,281 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,301 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-10-25 22:09:06,323 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_$Pointer$.base_47|]} [2020-10-25 22:09:06,328 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-10-25 22:09:06,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,365 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2020-10-25 22:09:06,366 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,403 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 85 [2020-10-25 22:09:06,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-10-25 22:09:06,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-25 22:09:06,409 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,426 INFO L625 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2020-10-25 22:09:06,426 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,427 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-10-25 22:09:06,455 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-10-25 22:09:06,456 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-10-25 22:09:06,471 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,478 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,478 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-10-25 22:09:06,483 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-25 22:09:06,483 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:06,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:06,486 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-10-25 22:09:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:06,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:06,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-25 22:09:06,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711396797] [2020-10-25 22:09:06,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 22:09:06,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:06,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 22:09:06,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-25 22:09:06,510 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 11 states. [2020-10-25 22:09:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:06,886 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-10-25 22:09:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 22:09:06,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-10-25 22:09:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:06,887 INFO L225 Difference]: With dead ends: 96 [2020-10-25 22:09:06,888 INFO L226 Difference]: Without dead ends: 81 [2020-10-25 22:09:06,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-10-25 22:09:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-25 22:09:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2020-10-25 22:09:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-25 22:09:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2020-10-25 22:09:06,899 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 37 [2020-10-25 22:09:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:06,899 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2020-10-25 22:09:06,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 22:09:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2020-10-25 22:09:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 22:09:06,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:06,900 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:07,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-25 22:09:07,105 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1306822559, now seen corresponding path program 2 times [2020-10-25 22:09:07,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:07,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234170051] [2020-10-25 22:09:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:07,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234170051] [2020-10-25 22:09:07,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910841043] [2020-10-25 22:09:07,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:07,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 22:09:07,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:09:07,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-25 22:09:07,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:07,450 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:07,450 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,460 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,460 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-25 22:09:07,478 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,478 INFO L384 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 [2020-10-25 22:09:07,479 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,494 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:07,494 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,507 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,507 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2020-10-25 22:09:07,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:09:07,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-10-25 22:09:07,523 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,530 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,530 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-10-25 22:09:07,542 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-25 22:09:07,542 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,552 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-10-25 22:09:07,605 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:07,606 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-25 22:09:07,607 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,618 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,620 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:07,620 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2020-10-25 22:09:07,719 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:07,719 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2020-10-25 22:09:07,720 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:07,786 INFO L625 ElimStorePlain]: treesize reduction 32, result has 58.4 percent of original size [2020-10-25 22:09:07,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,797 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:07,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:45 [2020-10-25 22:09:07,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:09:07,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 5, 1] term [2020-10-25 22:09:07,958 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-25 22:09:08,033 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-25 22:09:08,035 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:08,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:08,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:08,044 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2020-10-25 22:09:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:08,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:08,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2020-10-25 22:09:08,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647509950] [2020-10-25 22:09:08,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-25 22:09:08,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-25 22:09:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-10-25 22:09:08,059 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand 17 states. [2020-10-25 22:09:15,305 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-10-25 22:09:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:15,535 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2020-10-25 22:09:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-25 22:09:15,536 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2020-10-25 22:09:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:15,537 INFO L225 Difference]: With dead ends: 96 [2020-10-25 22:09:15,537 INFO L226 Difference]: Without dead ends: 90 [2020-10-25 22:09:15,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=574, Unknown=1, NotChecked=0, Total=702 [2020-10-25 22:09:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-25 22:09:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2020-10-25 22:09:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-25 22:09:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-10-25 22:09:15,543 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 37 [2020-10-25 22:09:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:15,544 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-10-25 22:09:15,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-25 22:09:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-10-25 22:09:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 22:09:15,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:15,545 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:15,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:15,756 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1056055519, now seen corresponding path program 1 times [2020-10-25 22:09:15,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:15,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966982438] [2020-10-25 22:09:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:15,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966982438] [2020-10-25 22:09:15,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26017264] [2020-10-25 22:09:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:16,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-25 22:09:16,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:16,106 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:16,106 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,108 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,108 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,109 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-25 22:09:16,166 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,167 INFO L384 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 [2020-10-25 22:09:16,168 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,199 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-10-25 22:09:16,208 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:16,208 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,220 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,221 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-10-25 22:09:16,274 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:16,274 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-25 22:09:16,274 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,283 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-10-25 22:09:16,337 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,338 INFO L384 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 [2020-10-25 22:09:16,339 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,362 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-25 22:09:16,362 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,374 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,375 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-10-25 22:09:16,436 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:16,436 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-25 22:09:16,437 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,451 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:16,451 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-10-25 22:09:16,524 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-25 22:09:16,524 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,544 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:16,544 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-25 22:09:16,642 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-25 22:09:16,643 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:16,658 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:16,658 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-25 22:09:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:16,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:16,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-10-25 22:09:16,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812968649] [2020-10-25 22:09:16,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-25 22:09:16,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-25 22:09:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-10-25 22:09:16,697 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 20 states. [2020-10-25 22:09:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:17,823 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2020-10-25 22:09:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 22:09:17,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2020-10-25 22:09:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:17,825 INFO L225 Difference]: With dead ends: 120 [2020-10-25 22:09:17,825 INFO L226 Difference]: Without dead ends: 112 [2020-10-25 22:09:17,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2020-10-25 22:09:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-25 22:09:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2020-10-25 22:09:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-25 22:09:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2020-10-25 22:09:17,836 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 37 [2020-10-25 22:09:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:17,837 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2020-10-25 22:09:17,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-25 22:09:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2020-10-25 22:09:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 22:09:17,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:17,838 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:18,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:18,051 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2099505628, now seen corresponding path program 1 times [2020-10-25 22:09:18,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:18,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361995627] [2020-10-25 22:09:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:18,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361995627] [2020-10-25 22:09:18,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239623637] [2020-10-25 22:09:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:18,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-25 22:09:18,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:18,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-25 22:09:18,359 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-25 22:09:18,423 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,423 INFO L384 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 [2020-10-25 22:09:18,424 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,457 INFO L625 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-10-25 22:09:18,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:18,463 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,477 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,477 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-10-25 22:09:18,524 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:18,524 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-10-25 22:09:18,525 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,534 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-10-25 22:09:18,578 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,579 INFO L384 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 [2020-10-25 22:09:18,580 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,592 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,597 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-25 22:09:18,597 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,608 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,608 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-10-25 22:09:18,666 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-10-25 22:09:18,666 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-10-25 22:09:18,667 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,683 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:18,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-10-25 22:09:18,739 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-25 22:09:18,739 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,756 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:18,757 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-25 22:09:18,839 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-25 22:09:18,841 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:18,851 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:18,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-25 22:09:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:18,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:18,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-10-25 22:09:18,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515700709] [2020-10-25 22:09:18,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-25 22:09:18,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-25 22:09:18,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-10-25 22:09:18,883 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand 20 states. [2020-10-25 22:09:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:21,968 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2020-10-25 22:09:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 22:09:21,968 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2020-10-25 22:09:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:21,969 INFO L225 Difference]: With dead ends: 130 [2020-10-25 22:09:21,970 INFO L226 Difference]: Without dead ends: 120 [2020-10-25 22:09:21,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2020-10-25 22:09:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-25 22:09:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2020-10-25 22:09:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-25 22:09:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2020-10-25 22:09:21,982 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 39 [2020-10-25 22:09:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:21,982 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2020-10-25 22:09:21,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-25 22:09:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2020-10-25 22:09:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 22:09:21,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:21,984 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:22,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-25 22:09:22,192 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412516, now seen corresponding path program 3 times [2020-10-25 22:09:22,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:22,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310990879] [2020-10-25 22:09:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:09:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:22,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310990879] [2020-10-25 22:09:22,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021733667] [2020-10-25 22:09:22,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:09:22,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-25 22:09:22,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 22:09:22,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 61 conjunts are in the unsatisfiable core [2020-10-25 22:09:22,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:09:22,707 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 9 [2020-10-25 22:09:22,708 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:22,714 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,714 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2020-10-25 22:09:22,742 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:22,742 INFO L384 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 [2020-10-25 22:09:22,744 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,775 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-10-25 22:09:22,775 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,775 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-10-25 22:09:22,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:22,820 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:22,847 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:22,848 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:22,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,869 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-10-25 22:09:22,939 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:22,939 INFO L384 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 [2020-10-25 22:09:22,940 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:22,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:22,974 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.base_54|, |v_#memory_$Pointer$.offset_47|]} [2020-10-25 22:09:22,986 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-25 22:09:22,987 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,049 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-10-25 22:09:23,050 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2020-10-25 22:09:23,050 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,096 INFO L625 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2020-10-25 22:09:23,103 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-10-25 22:09:23,104 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,122 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,122 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2020-10-25 22:09:23,217 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,218 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 149 [2020-10-25 22:09:23,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-10-25 22:09:23,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-10-25 22:09:23,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,296 INFO L625 ElimStorePlain]: treesize reduction 26, result has 85.6 percent of original size [2020-10-25 22:09:23,301 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 105 [2020-10-25 22:09:23,302 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-25 22:09:23,344 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2020-10-25 22:09:23,344 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,370 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,370 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2020-10-25 22:09:23,461 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_61|], 6=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_56|]} [2020-10-25 22:09:23,468 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2020-10-25 22:09:23,469 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,552 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,553 INFO L384 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 257 [2020-10-25 22:09:23,555 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,611 INFO L625 ElimStorePlain]: treesize reduction 100, result has 61.8 percent of original size [2020-10-25 22:09:23,644 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,645 INFO L384 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 2 case distinctions, treesize of input 159 treesize of output 145 [2020-10-25 22:09:23,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-10-25 22:09:23,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-25 22:09:23,648 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,691 INFO L625 ElimStorePlain]: treesize reduction 108, result has 49.3 percent of original size [2020-10-25 22:09:23,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,691 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2020-10-25 22:09:23,814 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,815 INFO L384 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 109 treesize of output 68 [2020-10-25 22:09:23,817 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-25 22:09:23,818 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-25 22:09:23,819 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:23,865 INFO L625 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2020-10-25 22:09:23,869 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2020-10-25 22:09:23,870 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-25 22:09:23,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-25 22:09:23,883 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-25 22:09:23,883 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2020-10-25 22:09:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 22:09:23,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:09:23,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2020-10-25 22:09:23,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151963914] [2020-10-25 22:09:23,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-25 22:09:23,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:09:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-25 22:09:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2020-10-25 22:09:23,997 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 20 states. [2020-10-25 22:09:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:09:24,909 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2020-10-25 22:09:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 22:09:24,911 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2020-10-25 22:09:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:09:24,913 INFO L225 Difference]: With dead ends: 135 [2020-10-25 22:09:24,913 INFO L226 Difference]: Without dead ends: 127 [2020-10-25 22:09:24,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2020-10-25 22:09:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-25 22:09:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-10-25 22:09:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-25 22:09:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2020-10-25 22:09:24,927 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 39 [2020-10-25 22:09:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:09:24,928 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2020-10-25 22:09:24,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-25 22:09:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2020-10-25 22:09:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-25 22:09:24,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:09:24,930 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:09:25,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-25 22:09:25,145 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 22:09:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:09:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1726504804, now seen corresponding path program 1 times [2020-10-25 22:09:25,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:09:25,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374394497] [2020-10-25 22:09:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:09:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:09:25,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:09:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 22:09:25,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 22:09:25,224 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 22:09:25,224 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 22:09:25,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 22:09:25,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:09:25 BoogieIcfgContainer [2020-10-25 22:09:25,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:09:25,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:09:25,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:09:25,281 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:09:25,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:08:58" (3/4) ... [2020-10-25 22:09:25,284 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 22:09:25,347 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:09:25,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:09:25,349 INFO L168 Benchmark]: Toolchain (without parser) took 28223.03 ms. Allocated memory was 44.0 MB in the beginning and 144.7 MB in the end (delta: 100.7 MB). Free memory was 29.0 MB in the beginning and 75.0 MB in the end (delta: -46.0 MB). Peak memory consumption was 54.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,349 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 44.0 MB. Free memory was 27.1 MB in the beginning and 27.0 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:09:25,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.74 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.4 MB in the beginning and 26.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.87 ms. Allocated memory is still 54.5 MB. Free memory was 26.1 MB in the beginning and 37.8 MB in the end (delta: -11.7 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,350 INFO L168 Benchmark]: Boogie Preprocessor took 41.43 ms. Allocated memory is still 54.5 MB. Free memory was 37.8 MB in the beginning and 35.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,351 INFO L168 Benchmark]: RCFGBuilder took 896.02 ms. Allocated memory is still 54.5 MB. Free memory was 35.7 MB in the beginning and 21.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,351 INFO L168 Benchmark]: TraceAbstraction took 26450.67 ms. Allocated memory was 54.5 MB in the beginning and 144.7 MB in the end (delta: 90.2 MB). Free memory was 20.8 MB in the beginning and 79.2 MB in the end (delta: -58.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,351 INFO L168 Benchmark]: Witness Printer took 67.16 ms. Allocated memory is still 144.7 MB. Free memory was 79.2 MB in the beginning and 75.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:09:25,354 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 44.0 MB. Free memory was 27.1 MB in the beginning and 27.0 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 679.74 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.4 MB in the beginning and 26.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.87 ms. Allocated memory is still 54.5 MB. Free memory was 26.1 MB in the beginning and 37.8 MB in the end (delta: -11.7 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.43 ms. Allocated memory is still 54.5 MB. Free memory was 37.8 MB in the beginning and 35.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 896.02 ms. Allocated memory is still 54.5 MB. Free memory was 35.7 MB in the beginning and 21.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26450.67 ms. Allocated memory was 54.5 MB in the beginning and 144.7 MB in the end (delta: 90.2 MB). Free memory was 20.8 MB in the beginning and 79.2 MB in the end (delta: -58.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 16.1 GB. * Witness Printer took 67.16 ms. Allocated memory is still 144.7 MB. Free memory was 79.2 MB in the beginning and 75.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) [L597] List t; [L598] List p = a; [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list_and_tree_cnstr-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.3s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 870 SDtfs, 836 SDslu, 4454 SDs, 0 SdLazy, 2660 SolverSat, 316 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 303 SyntacticMatches, 6 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=15, 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, 15 MinimizatonAttempts, 193 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 791 ConstructedInterpolants, 26 QuantifiedInterpolants, 223107 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 332 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 42/134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...