./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-ext3-properties/dll_circular_traversal-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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:46:58,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:46:58,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:46:58,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:46:58,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:46:58,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:46:58,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:46:58,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:46:58,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:46:58,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:46:58,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:46:58,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:46:58,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:46:58,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:46:58,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:46:58,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:46:58,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:46:58,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:46:58,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:46:58,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:46:58,181 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:46:58,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:46:58,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:46:58,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:46:58,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:46:58,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:46:58,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:46:58,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:46:58,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:46:58,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:46:58,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:46:58,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:46:58,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:46:58,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:46:58,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:46:58,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:46:58,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:46:58,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:46:58,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:46:58,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:46:58,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:46:58,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:46:58,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:46:58,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:46:58,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:46:58,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:46:58,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:46:58,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:46:58,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:46:58,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:46:58,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:46:58,215 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:46:58,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:46:58,215 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:46:58,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:46:58,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:46:58,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:46:58,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:46:58,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:46:58,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:46:58,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:46:58,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:46:58,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:46:58,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:46:58,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:46:58,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:46:58,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:46:58,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:46:58,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:46:58,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:46:58,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:46:58,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:46:58,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:46:58,220 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:46:58,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:46:58,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:46:58,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2022-07-19 14:46:58,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:46:58,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:46:58,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:46:58,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:46:58,413 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:46:58,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2022-07-19 14:46:58,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bff7aeb/82d005784c114712b572bed203bf7eba/FLAGfb4d0ba79 [2022-07-19 14:46:58,961 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:46:58,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2022-07-19 14:46:58,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bff7aeb/82d005784c114712b572bed203bf7eba/FLAGfb4d0ba79 [2022-07-19 14:46:59,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bff7aeb/82d005784c114712b572bed203bf7eba [2022-07-19 14:46:59,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:46:59,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:46:59,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:46:59,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:46:59,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:46:59,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9070a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59, skipping insertion in model container [2022-07-19 14:46:59,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:46:59,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:46:59,613 WARN L230 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2022-07-19 14:46:59,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:46:59,621 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:46:59,680 WARN L230 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2022-07-19 14:46:59,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:46:59,717 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:46:59,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59 WrapperNode [2022-07-19 14:46:59,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:46:59,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:46:59,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:46:59,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:46:59,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,772 INFO L137 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2022-07-19 14:46:59,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:46:59,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:46:59,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:46:59,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:46:59,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:46:59,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:46:59,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:46:59,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:46:59,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (1/1) ... [2022-07-19 14:46:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:46:59,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:59,851 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) [2022-07-19 14:46:59,879 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 [2022-07-19 14:46:59,899 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-19 14:46:59,900 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-19 14:46:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:46:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:46:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:46:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:46:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:46:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:46:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:46:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:46:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:46:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:47:00,002 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:47:00,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:47:00,036 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-19 14:47:00,181 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:47:00,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:47:00,187 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 14:47:00,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:47:00 BoogieIcfgContainer [2022-07-19 14:47:00,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:47:00,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:47:00,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:47:00,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:47:00,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:46:59" (1/3) ... [2022-07-19 14:47:00,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69584418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:47:00, skipping insertion in model container [2022-07-19 14:47:00,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:59" (2/3) ... [2022-07-19 14:47:00,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69584418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:47:00, skipping insertion in model container [2022-07-19 14:47:00,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:47:00" (3/3) ... [2022-07-19 14:47:00,196 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2022-07-19 14:47:00,207 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:47:00,208 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:47:00,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:47:00,251 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61c4e70c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@459518d [2022-07-19 14:47:00,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:47:00,255 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) [2022-07-19 14:47:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:47:00,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:00,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:00,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash 70364748, now seen corresponding path program 1 times [2022-07-19 14:47:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:47:00,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128667034] [2022-07-19 14:47:00,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:47:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:47:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128667034] [2022-07-19 14:47:00,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128667034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:47:00,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:47:00,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:47:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037802016] [2022-07-19 14:47:00,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:47:00,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:47:00,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:47:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:47:00,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:47:00,446 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2022-07-19 14:47:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:00,461 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-07-19 14:47:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:47:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-07-19 14:47:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:00,468 INFO L225 Difference]: With dead ends: 41 [2022-07-19 14:47:00,468 INFO L226 Difference]: Without dead ends: 18 [2022-07-19 14:47:00,470 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 [2022-07-19 14:47:00,474 INFO L413 NwaCegarLoop]: 31 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, 31 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 [2022-07-19 14:47:00,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:47:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-19 14:47:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-19 14:47:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2022-07-19 14:47:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-19 14:47:00,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-07-19 14:47:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:00,504 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-19 14:47:00,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2022-07-19 14:47:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-19 14:47:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:47:00,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:00,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:00,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:47:00,507 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash -273185064, now seen corresponding path program 1 times [2022-07-19 14:47:00,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:47:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981283269] [2022-07-19 14:47:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:47:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:00,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:47:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981283269] [2022-07-19 14:47:00,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981283269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:47:00,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:47:00,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:47:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114863171] [2022-07-19 14:47:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:47:00,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:47:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:47:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:47:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:47:00,631 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-07-19 14:47:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:00,652 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-07-19 14:47:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:47:00,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-07-19 14:47:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:00,654 INFO L225 Difference]: With dead ends: 32 [2022-07-19 14:47:00,654 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 14:47:00,658 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 [2022-07-19 14:47:00,660 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:00,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:47:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 14:47:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-07-19 14:47:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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) [2022-07-19 14:47:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-19 14:47:00,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-07-19 14:47:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:00,673 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-19 14:47:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-07-19 14:47:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-19 14:47:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 14:47:00,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:00,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:00,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:47:00,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783240, now seen corresponding path program 1 times [2022-07-19 14:47:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:47:00,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77880565] [2022-07-19 14:47:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:47:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:47:00,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77880565] [2022-07-19 14:47:00,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77880565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:47:00,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199373042] [2022-07-19 14:47:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:00,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:47:00,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:47:00,755 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) [2022-07-19 14:47:00,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:47:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:00,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:47:00,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:00,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:00,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199373042] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:00,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:47:00,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-19 14:47:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643434921] [2022-07-19 14:47:00,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:00,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:47:00,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:47:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:47:00,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:47:00,983 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) [2022-07-19 14:47:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:01,018 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-19 14:47:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:47:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Word has length 13 [2022-07-19 14:47:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:01,019 INFO L225 Difference]: With dead ends: 39 [2022-07-19 14:47:01,019 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:47:01,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:47:01,021 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:01,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:47:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:47:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:47:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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) [2022-07-19 14:47:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-19 14:47:01,026 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2022-07-19 14:47:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:01,026 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-19 14:47:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) [2022-07-19 14:47:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-19 14:47:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:47:01,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:01,027 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:01,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 14:47:01,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:47:01,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729048, now seen corresponding path program 2 times [2022-07-19 14:47:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:47:01,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783486830] [2022-07-19 14:47:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:47:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:47:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:47:01,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783486830] [2022-07-19 14:47:01,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783486830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:47:01,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680212866] [2022-07-19 14:47:01,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:47:01,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:47:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:47:01,613 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) [2022-07-19 14:47:01,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:47:01,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:47:01,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:47:01,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 14:47:01,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:01,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 14:47:01,934 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:47:01,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 14:47:01,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 14:47:01,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:47:02,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:02,048 INFO L356 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2022-07-19 14:47:02,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2022-07-19 14:47:02,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:47:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:47:02,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:02,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_399 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_399)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2022-07-19 14:47:03,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:03,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2022-07-19 14:47:03,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:03,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 144 [2022-07-19 14:47:03,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 154 treesize of output 146 [2022-07-19 14:47:03,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 78 [2022-07-19 14:47:03,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 33 [2022-07-19 14:47:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2022-07-19 14:47:03,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680212866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:03,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:47:03,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-19 14:47:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639920303] [2022-07-19 14:47:03,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:03,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 14:47:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:47:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 14:47:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=400, Unknown=1, NotChecked=40, Total=506 [2022-07-19 14:47:03,605 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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) [2022-07-19 14:47:04,162 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (forall ((v_ArrVal_399 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_399)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-07-19 14:47:04,867 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_399 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_399)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-07-19 14:47:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:04,958 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-07-19 14:47:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:47:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 22 [2022-07-19 14:47:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:04,959 INFO L225 Difference]: With dead ends: 32 [2022-07-19 14:47:04,959 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:47:04,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=732, Unknown=3, NotChecked=174, Total=1056 [2022-07-19 14:47:04,961 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:04,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-19 14:47:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:47:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 14:47:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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) [2022-07-19 14:47:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-19 14:47:04,965 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-07-19 14:47:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:04,965 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-19 14:47:04,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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) [2022-07-19 14:47:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-19 14:47:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:47:04,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:04,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:04,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:47:05,167 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,SelfDestructingSolverStorable3 [2022-07-19 14:47:05,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 625081166, now seen corresponding path program 1 times [2022-07-19 14:47:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:47:05,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735964962] [2022-07-19 14:47:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:47:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:47:05,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735964962] [2022-07-19 14:47:05,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735964962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:47:05,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426520368] [2022-07-19 14:47:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:47:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:47:05,644 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) [2022-07-19 14:47:05,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:47:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:05,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-19 14:47:05,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:05,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 14:47:05,861 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:47:05,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 14:47:05,894 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:47:05,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 14:47:05,995 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 14:47:05,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 14:47:06,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 14:47:06,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:47:06,165 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-19 14:47:06,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 14:47:06,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-19 14:47:06,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:47:06,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:47:06,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2022-07-19 14:47:06,273 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:47:06,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2022-07-19 14:47:06,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-19 14:47:06,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2022-07-19 14:47:06,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-07-19 14:47:06,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-19 14:47:06,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-07-19 14:47:06,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-07-19 14:47:06,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-19 14:47:06,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:06,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:47:06,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-19 14:47:06,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-07-19 14:47:06,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:47:06,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 14:47:06,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:47:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:47:06,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:06,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_674) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))))) is different from false [2022-07-19 14:47:06,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_674) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0))))) is different from false [2022-07-19 14:47:06,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_667 Int) (v_ArrVal_665 (Array Int Int))) (= (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_674) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_665) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2022-07-19 14:47:06,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:06,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 109 [2022-07-19 14:47:06,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:06,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:06,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 108 [2022-07-19 14:47:06,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 732 treesize of output 714 [2022-07-19 14:47:06,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 710 treesize of output 694 [2022-07-19 14:47:06,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 351 treesize of output 343 [2022-07-19 14:47:06,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:06,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:06,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 686 treesize of output 600 [2022-07-19 14:47:06,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4256 treesize of output 4154 [2022-07-19 14:47:06,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4150 treesize of output 4022 [2022-07-19 14:47:06,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4022 treesize of output 3958 [2022-07-19 14:48:08,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_41 Int) (|ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| Int) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_646 Int) (v_arrayElimCell_42 Int) (v_ArrVal_667 Int) (v_arrayElimCell_45 Int) (v_arrayElimCell_44 Int)) (let ((.cse1 (store (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_8))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646))))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_674)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (and .cse0 (= (select (select .cse1 v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)) (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_8 |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (let ((.cse2 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (and (= (select (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not .cse2)) (and .cse2 (= (select (select .cse1 v_arrayElimCell_42) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not .cse0))))) is different from false [2022-07-19 14:48:11,726 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-19 14:48:11,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 82 [2022-07-19 14:48:14,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~data#1| (select v_arrayElimArr_8 |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_646 Int) (v_arrayElimCell_42 Int) (v_ArrVal_667 Int) (v_arrayElimCell_45 Int)) (or (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_arrayElimArr_8 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646)))) (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_674) v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_arrayElimArr_8 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646)))) (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_674) v_arrayElimCell_42) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_674 (Array Int Int)) (v_ArrVal_646 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| Int) (v_ArrVal_667 Int)) (or (and (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| v_arrayElimArr_8))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646))))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667))) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| v_ArrVal_674) v_arrayElimCell_41) v_arrayElimCell_44))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13|) 0)) (= (select (select (store (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| v_arrayElimArr_8))) (store .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646))))) (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667))) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| v_ArrVal_674) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (and (forall ((v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int)) (= (select (select (store (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| v_arrayElimArr_8))) (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646))))) (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_667))) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| v_ArrVal_674) v_arrayElimCell_42) v_arrayElimCell_45) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_13| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_646 Int) (v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_arrayElimArr_8))) (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_646))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_674) v_arrayElimCell_41) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-07-19 14:48:14,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:14,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2022-07-19 14:48:14,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:14,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18370 treesize of output 18204 [2022-07-19 14:48:14,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18190 treesize of output 17070 [2022-07-19 14:48:14,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17166 treesize of output 17010 [2022-07-19 14:48:15,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:15,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8906 treesize of output 8880 [2022-07-19 14:48:16,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:16,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8448 treesize of output 8378 [2022-07-19 14:49:09,887 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 209 [2022-07-19 14:49:09,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:10,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:10,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11863726 treesize of output 11517684 [2022-07-19 14:50:12,505 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 6351 DAG size of output: 6350 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:50:12,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:50:12,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11909392 treesize of output 11821512 [2022-07-19 14:51:17,920 WARN L233 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 6370 DAG size of output: 6369 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:51:18,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:51:18,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11821376 treesize of output 11142800