./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/simple_search_value-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:41:59,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:41:59,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:41:59,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:41:59,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:41:59,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:41:59,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:41:59,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:41:59,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:41:59,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:41:59,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:41:59,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:41:59,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:41:59,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:41:59,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:41:59,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:41:59,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:41:59,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:41:59,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:41:59,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:41:59,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:41:59,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:41:59,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:41:59,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:41:59,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:41:59,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:41:59,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:41:59,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:41:59,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:41:59,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:41:59,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:41:59,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:41:59,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:41:59,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:41:59,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:41:59,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:41:59,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:41:59,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:41:59,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:41:59,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:41:59,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:41:59,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:41:59,275 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:41:59,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:41:59,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:41:59,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:41:59,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:41:59,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:41:59,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:41:59,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:41:59,277 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:41:59,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:41:59,278 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:41:59,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:41:59,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:41:59,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:41:59,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:41:59,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:41:59,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:41:59,279 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:41:59,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:41:59,280 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:41:59,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:41:59,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:41:59,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:41:59,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:41:59,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:41:59,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:41:59,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:41:59,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:41:59,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:41:59,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:41:59,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:41:59,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:41:59,282 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:41:59,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:41:59,282 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:41:59,282 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 [2023-02-15 10:41:59,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:41:59,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:41:59,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:41:59,524 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:41:59,525 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:41:59,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-02-15 10:42:00,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:42:00,676 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:42:00,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-02-15 10:42:00,691 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1719a7a0f/d8f44036787d4103b332e6095197785d/FLAG906deee49 [2023-02-15 10:42:00,723 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1719a7a0f/d8f44036787d4103b332e6095197785d [2023-02-15 10:42:00,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:42:00,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:42:00,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:42:00,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:42:00,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:42:00,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:42:00" (1/1) ... [2023-02-15 10:42:00,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac76e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:00, skipping insertion in model container [2023-02-15 10:42:00,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:42:00" (1/1) ... [2023-02-15 10:42:00,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:42:00,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:42:01,003 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-02-15 10:42:01,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:42:01,014 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:42:01,044 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-02-15 10:42:01,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:42:01,073 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:42:01,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01 WrapperNode [2023-02-15 10:42:01,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:42:01,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:42:01,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:42:01,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:42:01,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,120 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-02-15 10:42:01,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:42:01,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:42:01,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:42:01,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:42:01,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:42:01,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:42:01,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:42:01,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:42:01,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (1/1) ... [2023-02-15 10:42:01,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:42:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:42:01,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:42:01,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:42:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 10:42:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 10:42:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:42:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:42:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:42:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:42:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:42:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:42:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:42:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:42:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:42:01,285 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:42:01,294 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:42:01,344 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 10:42:01,442 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:42:01,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:42:01,446 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:42:01,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:42:01 BoogieIcfgContainer [2023-02-15 10:42:01,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:42:01,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:42:01,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:42:01,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:42:01,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:42:00" (1/3) ... [2023-02-15 10:42:01,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2411a076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:42:01, skipping insertion in model container [2023-02-15 10:42:01,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:42:01" (2/3) ... [2023-02-15 10:42:01,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2411a076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:42:01, skipping insertion in model container [2023-02-15 10:42:01,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:42:01" (3/3) ... [2023-02-15 10:42:01,453 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2023-02-15 10:42:01,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:42:01,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:42:01,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:42:01,499 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@32f8653, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:42:01,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:42:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 10:42:01,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:01,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:01,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2087165485, now seen corresponding path program 1 times [2023-02-15 10:42:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:01,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376727489] [2023-02-15 10:42:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:42:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:01,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376727489] [2023-02-15 10:42:01,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376727489] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:42:01,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:42:01,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:42:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311805466] [2023-02-15 10:42:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:42:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:42:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:42:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:42:01,674 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:01,697 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-02-15 10:42:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:42:01,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 10:42:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:01,703 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:42:01,704 INFO L226 Difference]: Without dead ends: 18 [2023-02-15 10:42:01,708 INFO L412 NwaCegarLoop]: 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 [2023-02-15 10:42:01,713 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:01,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:42:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-15 10:42:01,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-15 10:42:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-15 10:42:01,737 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2023-02-15 10:42:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:01,738 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-15 10:42:01,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-15 10:42:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 10:42:01,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:01,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:01,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:42:01,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2034265922, now seen corresponding path program 1 times [2023-02-15 10:42:01,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:01,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056350790] [2023-02-15 10:42:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:42:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:01,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056350790] [2023-02-15 10:42:01,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056350790] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:42:01,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:42:01,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:42:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172576870] [2023-02-15 10:42:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:42:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:42:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:42:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:42:01,793 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:01,805 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2023-02-15 10:42:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:42:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 10:42:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:01,806 INFO L225 Difference]: With dead ends: 28 [2023-02-15 10:42:01,806 INFO L226 Difference]: Without dead ends: 19 [2023-02-15 10:42:01,810 INFO L412 NwaCegarLoop]: 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 [2023-02-15 10:42:01,811 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:01,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:42:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-15 10:42:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-15 10:42:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-15 10:42:01,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-02-15 10:42:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:01,815 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-15 10:42:01,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-15 10:42:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 10:42:01,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:01,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:01,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:42:01,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1977007620, now seen corresponding path program 1 times [2023-02-15 10:42:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:01,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435564769] [2023-02-15 10:42:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:42:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:01,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435564769] [2023-02-15 10:42:01,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435564769] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:42:01,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:42:01,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:42:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571212632] [2023-02-15 10:42:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:42:01,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:42:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:42:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:42:01,910 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:01,951 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-02-15 10:42:01,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:42:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 10:42:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:01,953 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:42:01,953 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 10:42:01,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:42:01,954 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:01,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:42:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 10:42:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2023-02-15 10:42:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-15 10:42:01,957 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2023-02-15 10:42:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:01,957 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-15 10:42:01,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-15 10:42:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:42:01,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:01,958 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:01,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:42:01,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1102443704, now seen corresponding path program 1 times [2023-02-15 10:42:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:01,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379242762] [2023-02-15 10:42:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:42:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:02,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379242762] [2023-02-15 10:42:02,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379242762] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:42:02,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:42:02,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:42:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134531680] [2023-02-15 10:42:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:42:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:42:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:42:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:42:02,033 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:02,067 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-02-15 10:42:02,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:42:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 10:42:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:02,069 INFO L225 Difference]: With dead ends: 32 [2023-02-15 10:42:02,069 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 10:42:02,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:42:02,071 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:02,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:42:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 10:42:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-02-15 10:42:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-15 10:42:02,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2023-02-15 10:42:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:02,081 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-15 10:42:02,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-15 10:42:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:42:02,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:02,082 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:02,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:42:02,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 379985990, now seen corresponding path program 1 times [2023-02-15 10:42:02,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:02,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275811069] [2023-02-15 10:42:02,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:42:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:02,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275811069] [2023-02-15 10:42:02,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275811069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:42:02,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474952931] [2023-02-15 10:42:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:02,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:42:02,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:42:02,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:42:02,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:42:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:02,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:42:02,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:42:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:42:02,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:42:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:42:02,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474952931] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:42:02,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:42:02,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-15 10:42:02,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734402524] [2023-02-15 10:42:02,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:42:02,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 10:42:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 10:42:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:42:02,358 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:02,409 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-02-15 10:42:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:42:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:42:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:02,410 INFO L225 Difference]: With dead ends: 56 [2023-02-15 10:42:02,410 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:42:02,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:42:02,411 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:02,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:42:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:42:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-02-15 10:42:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-02-15 10:42:02,415 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2023-02-15 10:42:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:02,415 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-02-15 10:42:02,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-02-15 10:42:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:42:02,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:02,416 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:02,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:42:02,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:42:02,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1481516270, now seen corresponding path program 2 times [2023-02-15 10:42:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:02,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145505014] [2023-02-15 10:42:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:42:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:02,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145505014] [2023-02-15 10:42:02,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145505014] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:42:02,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239420658] [2023-02-15 10:42:02,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:42:02,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:42:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:42:02,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:42:02,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:42:03,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:42:03,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:42:03,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 10:42:03,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:42:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:42:03,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:42:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:42:03,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239420658] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:42:03,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:42:03,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 10:42:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421971110] [2023-02-15 10:42:03,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:42:03,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:42:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:42:03,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:42:03,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:42:03,160 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:42:03,288 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2023-02-15 10:42:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 10:42:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 10:42:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:42:03,289 INFO L225 Difference]: With dead ends: 86 [2023-02-15 10:42:03,289 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 10:42:03,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-02-15 10:42:03,290 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:42:03,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:42:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 10:42:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-02-15 10:42:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-02-15 10:42:03,295 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 36 [2023-02-15 10:42:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:42:03,295 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-02-15 10:42:03,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:42:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-02-15 10:42:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 10:42:03,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:42:03,297 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:42:03,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:42:03,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 10:42:03,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:42:03,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:42:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1904311442, now seen corresponding path program 3 times [2023-02-15 10:42:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:42:03,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027126033] [2023-02-15 10:42:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:42:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:42:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:42:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-02-15 10:42:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:42:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027126033] [2023-02-15 10:42:06,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027126033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:42:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508755346] [2023-02-15 10:42:06,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:42:06,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:42:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:42:06,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:42:06,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:42:15,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 10:42:15,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:42:15,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-15 10:42:15,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:42:15,210 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:42:15,262 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:42:15,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:42:15,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:42:15,347 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:42:15,348 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2023-02-15 10:42:15,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:42:15,395 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 34 [2023-02-15 10:42:15,441 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,441 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 10:42:15,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2023-02-15 10:42:15,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:42:15,503 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 10:42:15,503 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 34 [2023-02-15 10:42:15,556 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,556 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:15,608 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:15,609 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:15,665 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,666 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:15,698 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:15,698 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:15,744 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,745 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:15,784 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:15,784 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:15,834 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,836 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:15,862 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:15,863 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:15,900 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,901 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:15,936 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:15,936 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:15,993 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:15,994 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:16,037 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:16,038 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:16,082 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:16,083 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:16,115 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:42:16,115 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 27 [2023-02-15 10:42:16,191 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 15 [2023-02-15 10:42:16,200 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:42:16,200 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-02-15 10:42:16,251 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2023-02-15 10:42:16,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 31 [2023-02-15 10:42:16,310 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-02-15 10:42:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 14 proven. 130 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-15 10:42:16,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:42:16,395 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 74 [2023-02-15 10:42:16,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:16,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 29 treesize of output 33 [2023-02-15 10:42:16,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-15 10:42:18,726 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) is different from false [2023-02-15 10:42:18,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:18,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 41 [2023-02-15 10:42:18,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-15 10:42:19,736 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_2 Int) (v_subst_1 Int)) (or (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (= (select v_arrayElimArr_2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-15 10:42:19,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:19,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 41 [2023-02-15 10:42:19,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-15 10:42:19,945 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_2 Int) (v_subst_1 Int)) (or (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))))) is different from false [2023-02-15 10:42:19,996 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (forall ((v_ArrVal_616 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int)) (or (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-15 10:42:20,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:20,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 45 treesize of output 49 [2023-02-15 10:42:20,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-15 10:42:20,045 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int)) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_3 4) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-15 10:42:20,109 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (forall ((v_ArrVal_616 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int)) (or (not (= 0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_3 4) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-15 10:42:20,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:20,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 57 [2023-02-15 10:42:20,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-15 10:42:20,183 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int)) (or (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-15 10:42:20,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:20,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 33 treesize of output 37 [2023-02-15 10:42:20,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int) (v_ArrVal_616 (Array Int Int))) (or (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) v_subst_6 v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_3 4) 0))) is different from false [2023-02-15 10:42:20,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int) (v_ArrVal_616 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_38| Int)) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_38| v_arrayElimArr_6) v_subst_6 v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) is different from false [2023-02-15 10:42:20,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:20,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 36 treesize of output 40 [2023-02-15 10:42:20,684 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int) (v_ArrVal_616 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_38| Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_38| v_arrayElimArr_6) v_subst_6 v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))) is different from false [2023-02-15 10:42:20,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int) (v_ArrVal_616 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_38| Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_38| v_arrayElimArr_6) v_subst_6 v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_1 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) is different from false [2023-02-15 10:42:20,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:20,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 43 [2023-02-15 10:42:20,847 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int) (v_subst_1 Int) (v_ArrVal_616 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_38| Int)) (or (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_39| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_38| v_arrayElimArr_6) v_subst_6 v_arrayElimArr_5) v_subst_5 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_1) v_subst_1 v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= 0 (select v_arrayElimArr_7 4)) (= (select v_arrayElimArr_1 4) 0) (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) is different from false [2023-02-15 10:42:21,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:21,363 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2023-02-15 10:42:21,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:42:22,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:22,581 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 1208483841 treesize of output 1206910982 [2023-02-15 10:42:26,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:26,247 INFO L350 Elim1Store]: Elim1 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 1206910972 treesize of output 1072693250 [2023-02-15 10:42:29,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:30,025 INFO L350 Elim1Store]: Elim1 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 1072693244 treesize of output 1005584386 [2023-02-15 10:42:33,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:33,795 INFO L350 Elim1Store]: Elim1 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 1005584380 treesize of output 997195778 [2023-02-15 10:42:36,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 997195766 treesize of output 996147190 [2023-02-15 10:42:40,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:40,369 INFO L350 Elim1Store]: Elim1 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 996147196 treesize of output 979369986 [2023-02-15 10:42:43,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:43,947 INFO L350 Elim1Store]: Elim1 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 979369980 treesize of output 945815554 [2023-02-15 10:42:47,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:47,618 INFO L350 Elim1Store]: Elim1 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 945815548 treesize of output 941621250 [2023-02-15 10:42:51,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:42:51,118 INFO L350 Elim1Store]: Elim1 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 941621244 treesize of output 939524098