./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-simple/dll2n_insert_unequal.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 --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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:57:50,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:57:50,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:57:50,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:57:50,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:57:50,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:57:50,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:57:50,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:57:50,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:57:50,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:57:50,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:57:50,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:57:50,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:57:50,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:57:50,278 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:57:50,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:57:50,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:57:50,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:57:50,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:57:50,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:57:50,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:57:50,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:57:50,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:57:50,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:57:50,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:57:50,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:57:50,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:57:50,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:57:50,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:57:50,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:57:50,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:57:50,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:57:50,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:57:50,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:57:50,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:57:50,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:57:50,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:57:50,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:57:50,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:57:50,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:57:50,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:57:50,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:57:50,299 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-08 13:57:50,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:57:50,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:57:50,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:57:50,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:57:50,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:57:50,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-08 13:57:52,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:57:52,495 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:57:52,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-08 13:57:52,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f015f5cc/92e0b05367cf418cbc1813e9e9e5369e/FLAG2c48de615 [2024-11-08 13:57:52,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f015f5cc/92e0b05367cf418cbc1813e9e9e5369e [2024-11-08 13:57:52,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:57:52,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:57:52,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:57:52,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:57:52,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:57:52,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65604adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52, skipping insertion in model container [2024-11-08 13:57:52,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:57:52,980 WARN L250 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-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-08 13:57:52,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:57:52,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:57:53,043 WARN L250 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-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-08 13:57:53,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:57:53,102 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:57:53,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53 WrapperNode [2024-11-08 13:57:53,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:57:53,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:57:53,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:57:53,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:57:53,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,189 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-11-08 13:57:53,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:57:53,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:57:53,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:57:53,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:57:53,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,244 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 8, 21]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-11-08 13:57:53,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:57:53,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:57:53,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:57:53,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:57:53,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (1/1) ... [2024-11-08 13:57:53,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:57:53,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:53,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:57:53,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:57:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 13:57:53,403 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 13:57:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:57:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:57:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:57:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:57:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:57:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:57:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:57:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:57:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:57:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:57:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:57:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:57:53,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:57:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:57:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:57:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:57:53,533 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:57:53,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:57:53,550 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 13:57:53,735 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-08 13:57:53,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:57:53,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:57:53,743 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-08 13:57:53,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:57:53 BoogieIcfgContainer [2024-11-08 13:57:53,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:57:53,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:57:53,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:57:53,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:57:53,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:57:52" (1/3) ... [2024-11-08 13:57:53,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec54e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:57:53, skipping insertion in model container [2024-11-08 13:57:53,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:53" (2/3) ... [2024-11-08 13:57:53,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec54e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:57:53, skipping insertion in model container [2024-11-08 13:57:53,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:57:53" (3/3) ... [2024-11-08 13:57:53,749 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-08 13:57:53,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:57:53,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:57:53,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:57:53,802 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1048b900, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:57:53,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:57:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 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) [2024-11-08 13:57:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:57:53,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:53,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:53,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:53,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:53,814 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2024-11-08 13:57:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954175322] [2024-11-08 13:57:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954175322] [2024-11-08 13:57:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954175322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:53,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:57:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289998927] [2024-11-08 13:57:53,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:53,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:57:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:57:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:57:54,003 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:57:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:54,018 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-11-08 13:57:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:57:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 13:57:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:54,024 INFO L225 Difference]: With dead ends: 64 [2024-11-08 13:57:54,024 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:57:54,026 INFO L431 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 [2024-11-08 13:57:54,029 INFO L432 NwaCegarLoop]: 49 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, 49 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 [2024-11-08 13:57:54,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:57:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:57:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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) [2024-11-08 13:57:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-11-08 13:57:54,051 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2024-11-08 13:57:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:54,052 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-11-08 13:57:54,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:57:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-08 13:57:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:57:54,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:54,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:54,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:57:54,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:54,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2024-11-08 13:57:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317947385] [2024-11-08 13:57:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:54,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317947385] [2024-11-08 13:57:54,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317947385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:54,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:54,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:57:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118813587] [2024-11-08 13:57:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:54,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:57:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:57:54,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:57:54,193 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:57:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:54,206 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-08 13:57:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:57:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 13:57:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:54,209 INFO L225 Difference]: With dead ends: 52 [2024-11-08 13:57:54,209 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:57:54,209 INFO L431 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 [2024-11-08 13:57:54,210 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:54,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:57:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-08 13:57:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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) [2024-11-08 13:57:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-08 13:57:54,217 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2024-11-08 13:57:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:54,217 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-08 13:57:54,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:57:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-08 13:57:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:57:54,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:54,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:54,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:57:54,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2024-11-08 13:57:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939048489] [2024-11-08 13:57:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939048489] [2024-11-08 13:57:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939048489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:57:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43253503] [2024-11-08 13:57:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:54,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:57:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:57:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:57:54,346 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-11-08 13:57:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:54,362 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-08 13:57:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:57:54,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-08 13:57:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:54,363 INFO L225 Difference]: With dead ends: 56 [2024-11-08 13:57:54,363 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 13:57:54,363 INFO L431 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 [2024-11-08 13:57:54,364 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:54,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 13:57:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 13:57:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:57:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-08 13:57:54,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2024-11-08 13:57:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:54,368 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-08 13:57:54,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-11-08 13:57:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-08 13:57:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:57:54,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:54,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:54,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:57:54,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:54,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2024-11-08 13:57:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481314074] [2024-11-08 13:57:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:54,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:54,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481314074] [2024-11-08 13:57:54,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481314074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:54,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063499676] [2024-11-08 13:57:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:54,462 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) [2024-11-08 13:57:54,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:57:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:57:54,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:54,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063499676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:57:54,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:57:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 13:57:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859065462] [2024-11-08 13:57:54,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:57:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:57:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:57:54,663 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2024-11-08 13:57:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:54,687 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-08 13:57:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:57:54,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 20 [2024-11-08 13:57:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:54,688 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:57:54,688 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 13:57:54,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:57:54,689 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:54,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 13:57:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 13:57:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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) [2024-11-08 13:57:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-08 13:57:54,695 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2024-11-08 13:57:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-08 13:57:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2024-11-08 13:57:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-08 13:57:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:57:54,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:54,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:54,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:57:54,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:54,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2024-11-08 13:57:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192491295] [2024-11-08 13:57:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:57:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:55,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192491295] [2024-11-08 13:57:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192491295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:55,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:55,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:57:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372262818] [2024-11-08 13:57:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:55,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:57:55,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:57:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:57:55,011 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-11-08 13:57:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:55,028 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-08 13:57:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:57:55,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) Word has length 25 [2024-11-08 13:57:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:55,029 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:57:55,029 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 13:57:55,029 INFO L431 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 [2024-11-08 13:57:55,030 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:55,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 13:57:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-08 13:57:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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) [2024-11-08 13:57:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-08 13:57:55,037 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-08 13:57:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:55,038 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-08 13:57:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2024-11-08 13:57:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-08 13:57:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 13:57:55,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:55,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:55,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:57:55,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:55,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2024-11-08 13:57:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116757009] [2024-11-08 13:57:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:57:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116757009] [2024-11-08 13:57:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116757009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:57:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86406148] [2024-11-08 13:57:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:55,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:57:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:55,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:57:55,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:57:55,247 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2024-11-08 13:57:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:55,268 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-08 13:57:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:57:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) Word has length 26 [2024-11-08 13:57:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:55,269 INFO L225 Difference]: With dead ends: 49 [2024-11-08 13:57:55,269 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:57:55,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:57:55,270 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:55,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:57:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 13:57:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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) [2024-11-08 13:57:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-08 13:57:55,276 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2024-11-08 13:57:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:55,277 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-08 13:57:55,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2024-11-08 13:57:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-08 13:57:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 13:57:55,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:55,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:55,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:57:55,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:55,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2024-11-08 13:57:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:55,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743755953] [2024-11-08 13:57:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743755953] [2024-11-08 13:57:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743755953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813286641] [2024-11-08 13:57:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:56,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:56,678 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) [2024-11-08 13:57:56,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:57:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:57,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-08 13:57:57,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:57,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:57:57,201 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:57:57,201 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:57:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-08 13:57:57,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-08 13:57:57,389 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:57:57,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-08 13:57:57,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 13:57:57,660 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:57:57,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:57:57,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-08 13:57:57,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:57:57,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2024-11-08 13:57:58,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-08 13:57:58,075 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 15 [2024-11-08 13:57:58,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:57:58,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:57:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:58,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:58,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2024-11-08 13:57:58,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2024-11-08 13:58:00,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:00,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 324 treesize of output 316 [2024-11-08 13:58:00,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2024-11-08 13:58:00,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2024-11-08 13:58:00,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2024-11-08 13:58:00,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:00,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 103 [2024-11-08 13:58:00,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:00,265 INFO L378 Elim1Store]: Elim1 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 339 treesize of output 303 [2024-11-08 13:58:00,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 127 [2024-11-08 13:58:00,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 119 [2024-11-08 13:58:00,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2024-11-08 13:58:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813286641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:00,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-08 13:58:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947609626] [2024-11-08 13:58:00,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:00,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 13:58:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 13:58:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1854, Unknown=65, NotChecked=0, Total=2070 [2024-11-08 13:58:00,598 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 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) [2024-11-08 13:58:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:02,019 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-08 13:58:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 13:58:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 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 26 [2024-11-08 13:58:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:02,020 INFO L225 Difference]: With dead ends: 60 [2024-11-08 13:58:02,020 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 13:58:02,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=316, Invalid=3157, Unknown=67, NotChecked=0, Total=3540 [2024-11-08 13:58:02,021 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:02,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 277 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 13:58:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 13:58:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2024-11-08 13:58:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 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) [2024-11-08 13:58:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-08 13:58:02,026 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 26 [2024-11-08 13:58:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:02,026 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-08 13:58:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 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) [2024-11-08 13:58:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-08 13:58:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:58:02,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:02,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:02,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:02,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 13:58:02,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:02,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 201100899, now seen corresponding path program 1 times [2024-11-08 13:58:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:02,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497675880] [2024-11-08 13:58:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497675880] [2024-11-08 13:58:02,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497675880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439791757] [2024-11-08 13:58:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:02,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:02,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:02,345 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) [2024-11-08 13:58:02,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:58:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:02,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 13:58:02,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:02,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439791757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:02,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:02,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 13:58:02,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824455347] [2024-11-08 13:58:02,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:02,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:58:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:58:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:58:02,524 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-08 13:58:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:02,592 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-08 13:58:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:58:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2024-11-08 13:58:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:02,593 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:58:02,593 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 13:58:02,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:58:02,594 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:02,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 13:58:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-08 13:58:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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) [2024-11-08 13:58:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-08 13:58:02,598 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 27 [2024-11-08 13:58:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:02,598 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-08 13:58:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-08 13:58:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-08 13:58:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:58:02,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:02,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:02,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:58:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:02,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 258359201, now seen corresponding path program 1 times [2024-11-08 13:58:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505627676] [2024-11-08 13:58:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505627676] [2024-11-08 13:58:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505627676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166577201] [2024-11-08 13:58:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:02,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:02,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:02,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:02,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:58:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:03,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 13:58:03,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:03,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 13:58:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:03,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166577201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:03,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2024-11-08 13:58:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292078579] [2024-11-08 13:58:03,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:03,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:58:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:58:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:58:03,132 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:03,235 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2024-11-08 13:58:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:58:03,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 13:58:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:03,237 INFO L225 Difference]: With dead ends: 74 [2024-11-08 13:58:03,237 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 13:58:03,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:58:03,237 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:03,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 204 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 13:58:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-08 13:58:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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) [2024-11-08 13:58:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-08 13:58:03,241 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 27 [2024-11-08 13:58:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:03,241 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-08 13:58:03,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-08 13:58:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:58:03,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:03,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:03,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:03,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:03,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:03,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1464037342, now seen corresponding path program 1 times [2024-11-08 13:58:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061329295] [2024-11-08 13:58:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:03,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:03,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061329295] [2024-11-08 13:58:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061329295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 13:58:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695342492] [2024-11-08 13:58:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 13:58:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 13:58:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:58:03,643 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-08 13:58:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:03,746 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-08 13:58:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 13:58:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2024-11-08 13:58:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:03,747 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:58:03,747 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 13:58:03,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:58:03,748 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:03,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 13:58:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-08 13:58:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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) [2024-11-08 13:58:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-11-08 13:58:03,755 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 27 [2024-11-08 13:58:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:03,755 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-08 13:58:03,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-08 13:58:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-11-08 13:58:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:58:03,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:03,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:03,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 13:58:03,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:03,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2045561648, now seen corresponding path program 2 times [2024-11-08 13:58:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:03,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006398144] [2024-11-08 13:58:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:03,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:03,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006398144] [2024-11-08 13:58:03,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006398144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:03,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477547584] [2024-11-08 13:58:03,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:58:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:03,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:03,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:03,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 13:58:04,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:58:04,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:58:04,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 13:58:04,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:04,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:58:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477547584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:04,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:58:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-08 13:58:04,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138066412] [2024-11-08 13:58:04,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:04,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:58:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:04,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:58:04,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:58:04,117 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:04,148 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-08 13:58:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:58:04,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 13:58:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:04,149 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:58:04,149 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:58:04,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:58:04,150 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:04,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:58:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 13:58:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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) [2024-11-08 13:58:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-08 13:58:04,155 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2024-11-08 13:58:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:04,155 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-08 13:58:04,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-08 13:58:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 13:58:04,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:04,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:04,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 13:58:04,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 13:58:04,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:04,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1857767657, now seen corresponding path program 1 times [2024-11-08 13:58:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653942157] [2024-11-08 13:58:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653942157] [2024-11-08 13:58:04,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653942157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:04,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530761613] [2024-11-08 13:58:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:04,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:04,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:04,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:04,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 13:58:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:04,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 13:58:04,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:04,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:04,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530761613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:04,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:04,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-08 13:58:04,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33492895] [2024-11-08 13:58:04,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:04,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:58:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:04,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:58:04,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:58:04,818 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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) [2024-11-08 13:58:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:04,882 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-08 13:58:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:58:04,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 28 [2024-11-08 13:58:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:04,883 INFO L225 Difference]: With dead ends: 44 [2024-11-08 13:58:04,883 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 13:58:04,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-08 13:58:04,884 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:04,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 135 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 13:58:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-08 13:58:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2024-11-08 13:58:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-08 13:58:04,888 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2024-11-08 13:58:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:04,889 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-08 13:58:04,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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) [2024-11-08 13:58:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-08 13:58:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 13:58:04,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:04,890 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:04,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:05,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:05,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1756277405, now seen corresponding path program 1 times [2024-11-08 13:58:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735151749] [2024-11-08 13:58:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:06,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735151749] [2024-11-08 13:58:06,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735151749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:06,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654419987] [2024-11-08 13:58:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:06,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:06,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:06,365 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:06,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 13:58:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:06,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-08 13:58:06,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:06,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:06,863 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:06,863 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:58:06,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-08 13:58:06,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-08 13:58:06,977 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:58:06,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-08 13:58:06,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-08 13:58:07,155 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:58:07,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:58:07,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:58:07,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-08 13:58:07,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-08 13:58:07,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:07,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2024-11-08 13:58:07,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 11 [2024-11-08 13:58:07,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-08 13:58:07,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-08 13:58:07,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2024-11-08 13:58:07,599 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 20 [2024-11-08 13:58:07,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2024-11-08 13:58:07,684 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 19 [2024-11-08 13:58:07,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-08 13:58:07,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2024-11-08 13:58:07,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-08 13:58:07,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:58:07,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:58:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:07,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:07,956 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1469) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1468) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1470) .cse0) .cse1))))) is different from false [2024-11-08 13:58:07,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (or (not (= v_ArrVal_1461 (let ((.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1461 .cse1))) .cse2 (select v_ArrVal_1461 .cse2))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1461) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1469) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1468) .cse4) .cse5)) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1470) .cse4) .cse5))))))) is different from false [2024-11-08 13:58:08,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1461) .cse1 v_ArrVal_1469) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1468) .cse4) .cse5)) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1467) .cse1 v_ArrVal_1470) .cse4) .cse5))))) (not (= v_ArrVal_1461 (let ((.cse7 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (store (let ((.cse6 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1461 .cse6))) .cse7 (select v_ArrVal_1461 .cse7)))))))) is different from false [2024-11-08 13:58:08,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int#2| .cse2 v_ArrVal_1460))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse1 (select .cse3 .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1461) .cse1 v_ArrVal_1469) (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 .cse4 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1468) .cse5) .cse6)) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store (select |c_#memory_$Pointer$#2.offset| .cse2) .cse4 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1467) .cse1 v_ArrVal_1470) .cse5) .cse6))))) (not (= (let ((.cse8 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (store (let ((.cse7 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|))) (store (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 (select v_ArrVal_1461 .cse7))) .cse8 (select v_ArrVal_1461 .cse8))) v_ArrVal_1461)))))) is different from false [2024-11-08 13:58:08,073 INFO L349 Elim1Store]: treesize reduction 263, result has 51.1 percent of original size [2024-11-08 13:58:08,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3553 treesize of output 3563 [2024-11-08 13:58:08,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1562 treesize of output 1306 [2024-11-08 13:58:08,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:08,113 INFO L378 Elim1Store]: Elim1 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 339 treesize of output 341 [2024-11-08 13:58:08,159 INFO L349 Elim1Store]: treesize reduction 348, result has 39.8 percent of original size [2024-11-08 13:58:08,159 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 684 treesize of output 831 [2024-11-08 13:58:08,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 4 [2024-11-08 13:58:08,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1699 treesize of output 1707 [2024-11-08 13:58:08,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:08,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1107 treesize of output 1117 [2024-11-08 13:58:09,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2024-11-08 13:58:09,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:09,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 366 treesize of output 505 [2024-11-08 13:58:10,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| .cse3 (store (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#2.base| .cse3 (store .cse11 .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse8 (select .cse11 .cse4))) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6)) (.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6))) (or (= .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (or (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_3) .cse8 v_prenex_2) .cse5) .cse6) .cse3)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6))) (or (= .cse9 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6)) (= .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6) .cse10) (= .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3)) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1462) .cse8 v_ArrVal_1468) .cse5) .cse6) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int))) (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_9) .cse8 v_prenex_8) .cse5) .cse6) .cse8))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_node_create_~data#1|))))) is different from false [2024-11-08 13:58:10,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 953 treesize of output 697 [2024-11-08 13:58:10,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 701 treesize of output 513 [2024-11-08 13:58:11,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 79 [2024-11-08 13:58:11,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,785 INFO L378 Elim1Store]: Elim1 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 141 treesize of output 105 [2024-11-08 13:58:11,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-08 13:58:11,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-08 13:58:11,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 101 [2024-11-08 13:58:11,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 116 [2024-11-08 13:58:11,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:58:11,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:58:11,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2024-11-08 13:58:11,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 63 [2024-11-08 13:58:11,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:11,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:58:11,863 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 53 [2024-11-08 13:58:11,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,878 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 31 [2024-11-08 13:58:11,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:58:11,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 54 [2024-11-08 13:58:11,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,903 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 31 [2024-11-08 13:58:11,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:58:11,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:11,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:58:11,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 53 [2024-11-08 13:58:11,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:11,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,946 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 31 [2024-11-08 13:58:11,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:58:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 13:58:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654419987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:12,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:12,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 52 [2024-11-08 13:58:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028966120] [2024-11-08 13:58:12,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 13:58:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 13:58:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1966, Unknown=20, NotChecked=470, Total=2652 [2024-11-08 13:58:12,209 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 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) [2024-11-08 13:58:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:13,871 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-08 13:58:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 13:58:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 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 29 [2024-11-08 13:58:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:13,872 INFO L225 Difference]: With dead ends: 38 [2024-11-08 13:58:13,872 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:58:13,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=287, Invalid=2575, Unknown=20, NotChecked=540, Total=3422 [2024-11-08 13:58:13,874 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:13,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 277 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 847 Invalid, 0 Unknown, 184 Unchecked, 1.1s Time] [2024-11-08 13:58:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:58:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-08 13:58:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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) [2024-11-08 13:58:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-08 13:58:13,877 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2024-11-08 13:58:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:13,878 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-08 13:58:13,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 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) [2024-11-08 13:58:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-08 13:58:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 13:58:13,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:13,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:13,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 13:58:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:14,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:14,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash 139595796, now seen corresponding path program 1 times [2024-11-08 13:58:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:14,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577097084] [2024-11-08 13:58:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577097084] [2024-11-08 13:58:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577097084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033912260] [2024-11-08 13:58:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:15,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:15,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 13:58:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:15,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-08 13:58:15,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:15,744 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:15,744 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:58:15,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-11-08 13:58:15,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 13:58:15,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-08 13:58:15,976 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-08 13:58:15,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-08 13:58:16,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2024-11-08 13:58:16,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 55 [2024-11-08 13:58:16,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-11-08 13:58:16,263 INFO L378 Elim1Store]: Elim1 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 54 treesize of output 21 [2024-11-08 13:58:16,332 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-08 13:58:16,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 98 [2024-11-08 13:58:16,338 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 21 [2024-11-08 13:58:16,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 95 [2024-11-08 13:58:16,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 71 [2024-11-08 13:58:16,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 13:58:16,601 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:58:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 23 [2024-11-08 13:58:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:16,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:16,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:16,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 131 [2024-11-08 13:58:16,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:16,831 INFO L378 Elim1Store]: Elim1 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 503 treesize of output 502 [2024-11-08 13:58:16,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 462 [2024-11-08 13:58:16,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 454 [2024-11-08 13:58:16,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ .cse2 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse3 (= .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (let ((.cse11 (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_118 Int)) (not (= (select (let ((.cse14 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse14 (select (select .cse14 .cse5) .cse6))) (+ v_arrayElimCell_118 4)) 0))) (not .cse3)))) (let ((.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5)) (.cse1 (and (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_116 Int)) (not (= (select (let ((.cse13 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse13 (select (select .cse13 .cse5) .cse6))) (+ v_arrayElimCell_116 4)) 0))) .cse3) .cse11))) (and (or .cse0 .cse1 (= .cse2 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or (not .cse0) (and (or .cse3 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_119 Int)) (not (= (select (let ((.cse4 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse4 (select (select .cse4 .cse5) .cse6))) (+ v_arrayElimCell_119 4)) 0)))) .cse11)) (or (and .cse11 (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int)) (not (= (select (let ((.cse12 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse12 (select (select .cse12 .cse5) .cse6))) .cse10) 0))) .cse3)) .cse0) (or .cse0 .cse1 (= .cse5 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|))))))) is different from false [2024-11-08 13:58:17,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse17 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse16 .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse13 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse16 .cse17)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse8 .cse2)) (.cse3 (+ .cse13 4)) (.cse5 (select .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse10 (or (not .cse9) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_118 Int)) (not (= (select (let ((.cse15 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse15 (select (select .cse15 .cse2) .cse3))) (+ v_arrayElimCell_118 4)) 0)))))) (let ((.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse2)) (.cse12 (and (or .cse9 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_116 Int)) (not (= (select (let ((.cse14 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse14 (select (select .cse14 .cse2) .cse3))) (+ v_arrayElimCell_116 4)) 0)))) .cse10))) (and (or .cse0 (and (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int)) (not (= (select (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse1 (select (select .cse1 .cse2) .cse3))) .cse7) 0))) .cse9) .cse10)) (or (not .cse0) (and (or .cse9 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_119 Int)) (not (= (select (let ((.cse11 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse11 (select (select .cse11 .cse2) .cse3))) (+ v_arrayElimCell_119 4)) 0)))) .cse10)) (or .cse0 (= .cse2 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse12) (or .cse0 .cse12 (= .cse13 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|)))))))) is different from false [2024-11-08 13:58:17,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ .cse2 4)) (.cse10 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse3 4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse15 (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse30 (select .cse28 .cse7))) (let ((.cse29 (select .cse30 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_118 Int)) (not (= (select (let ((.cse26 (store (let ((.cse27 (store .cse30 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse27) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse28 .cse7 .cse27) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse29))) .cse29 v_ArrVal_1646))) (select .cse26 (select (select .cse26 .cse5) .cse6))) (+ v_arrayElimCell_118 4)) 0))) (not (= .cse29 .cse5))))))))) (let ((.cse0 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse5)) (.cse1 (and (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse25 (select .cse23 .cse7))) (let ((.cse24 (select .cse25 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_116 Int)) (not (= 0 (select (let ((.cse21 (store (let ((.cse22 (store .cse25 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse22) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse23 .cse7 .cse22) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse24))) .cse24 v_ArrVal_1646))) (select .cse21 (select (select .cse21 .cse5) .cse6))) (+ v_arrayElimCell_116 4))))) (= .cse24 .cse5)))))) .cse15))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or (and (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse13 (select .cse9 .cse7))) (let ((.cse12 (select .cse13 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_119 Int)) (not (= (select (let ((.cse4 (store (let ((.cse8 (store .cse13 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse8) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse9 .cse7 .cse8) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse12))) .cse12 v_ArrVal_1646))) (select .cse4 (select (select .cse4 .cse5) .cse6))) (+ v_arrayElimCell_119 4)) 0))) (= .cse12 .cse5)))))) .cse15) (not .cse0)) (or .cse0 (and (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse20 (select .cse18 .cse7))) (let ((.cse19 (select .cse20 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int)) (not (= (select (let ((.cse16 (store (let ((.cse17 (store .cse20 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse18 .cse7 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse19))) .cse19 v_ArrVal_1646))) (select .cse16 (select (select .cse16 .cse5) .cse6))) .cse11) 0))) (= .cse19 .cse5)))))) .cse15)) (or .cse0 .cse1 (= .cse5 .cse7))))))) is different from false [2024-11-08 13:58:17,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1033 treesize of output 781 [2024-11-08 13:58:17,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 785 treesize of output 621 [2024-11-08 13:58:17,628 INFO L349 Elim1Store]: treesize reduction 28, result has 51.7 percent of original size [2024-11-08 13:58:17,629 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 61 [2024-11-08 13:58:17,664 INFO L349 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2024-11-08 13:58:17,664 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 58 [2024-11-08 13:58:18,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:18,960 INFO L349 Elim1Store]: treesize reduction 75, result has 48.3 percent of original size [2024-11-08 13:58:18,960 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 89565 treesize of output 49395 [2024-11-08 13:58:19,459 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:19,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:19,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5992 treesize of output 5730 [2024-11-08 13:58:19,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 572 treesize of output 500 [2024-11-08 13:58:19,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:19,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 548 treesize of output 502 [2024-11-08 13:58:19,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-11-08 13:58:19,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:19,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1502 treesize of output 1438 [2024-11-08 13:58:19,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:19,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 127 [2024-11-08 13:58:19,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2024-11-08 13:58:19,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:19,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 115 [2024-11-08 13:58:19,770 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:19,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:19,811 INFO L349 Elim1Store]: treesize reduction 79, result has 48.4 percent of original size [2024-11-08 13:58:19,812 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 12164 treesize of output 6578 [2024-11-08 13:58:19,887 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:19,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:19,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4688 treesize of output 4442 [2024-11-08 13:58:19,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5159 treesize of output 5015 [2024-11-08 13:58:20,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:20,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3860 treesize of output 3484 [2024-11-08 13:58:20,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:20,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3503 treesize of output 3067 [2024-11-08 13:58:20,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:58:20,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:20,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 70 [2024-11-08 13:58:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 13:58:21,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033912260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:21,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 52 [2024-11-08 13:58:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518793513] [2024-11-08 13:58:21,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:21,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 13:58:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 13:58:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2169, Unknown=32, NotChecked=288, Total=2652 [2024-11-08 13:58:21,229 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 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) [2024-11-08 13:58:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:24,623 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-08 13:58:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 13:58:24,624 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 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 31 [2024-11-08 13:58:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:24,624 INFO L225 Difference]: With dead ends: 48 [2024-11-08 13:58:24,624 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 13:58:24,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=394, Invalid=4548, Unknown=40, NotChecked=420, Total=5402 [2024-11-08 13:58:24,626 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:24,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 206 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 798 Invalid, 0 Unknown, 109 Unchecked, 1.4s Time] [2024-11-08 13:58:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 13:58:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-08 13:58:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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) [2024-11-08 13:58:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-11-08 13:58:24,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2024-11-08 13:58:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-11-08 13:58:24,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 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) [2024-11-08 13:58:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-11-08 13:58:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 13:58:24,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:24,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:24,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 13:58:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 13:58:24,832 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 139597470, now seen corresponding path program 1 times [2024-11-08 13:58:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660533046] [2024-11-08 13:58:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660533046] [2024-11-08 13:58:26,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660533046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182219854] [2024-11-08 13:58:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:26,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:26,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:26,468 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:26,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 13:58:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:26,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-08 13:58:26,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:26,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-08 13:58:27,073 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:27,073 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:58:27,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-08 13:58:27,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 13:58:27,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-08 13:58:27,207 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:58:27,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2024-11-08 13:58:27,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-08 13:58:27,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-08 13:58:27,419 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:58:27,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:58:27,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2024-11-08 13:58:27,540 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 19 [2024-11-08 13:58:27,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-11-08 13:58:27,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2024-11-08 13:58:27,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 41 [2024-11-08 13:58:27,832 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 11 [2024-11-08 13:58:27,928 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-08 13:58:27,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 112 [2024-11-08 13:58:27,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:27,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 43 [2024-11-08 13:58:27,945 INFO L378 Elim1Store]: Elim1 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 71 treesize of output 23 [2024-11-08 13:58:28,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 83 [2024-11-08 13:58:28,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:58:28,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2024-11-08 13:58:28,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-08 13:58:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:28,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:28,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1841)) (.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1843)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1840) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (= v_ArrVal_1840 (let ((.cse6 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse6 (select v_ArrVal_1840 .cse6))))))) is different from false [2024-11-08 13:58:28,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1830))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 (select v_ArrVal_1840 .cse1))) v_ArrVal_1840)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse12 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse9 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1832) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1843)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (store .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2024-11-08 13:58:28,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1830)) (.cse1 (select .cse11 .cse12)) (.cse14 (select .cse15 .cse12))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse15 .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse9 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse10 .cse14))) .cse1 v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse11 .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1832) .cse10 .cse1))) .cse1 v_ArrVal_1843)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ 4 (select (select .cse5 .cse6) .cse7)))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (= (let ((.cse16 (+ .cse14 8))) (store (select .cse0 .cse1) .cse16 (select v_ArrVal_1840 .cse16))) v_ArrVal_1840)))))) is different from false [2024-11-08 13:58:28,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| .cse11)) (.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ .cse15 4))) (let ((.cse0 (store (store |c_#memory_int#2| .cse11 v_ArrVal_1835) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1830)) (.cse1 (select .cse12 .cse13)) (.cse16 (select .cse17 .cse13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (let ((.cse14 (store |c_#memory_$Pointer$#2.offset| .cse11 (store .cse17 .cse13 |c_ULTIMATE.start_node_create_#res#1.offset|)))) (store .cse14 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse14 |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 .cse15) .cse10 .cse16))) .cse1 v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse11 (store .cse12 .cse13 |c_ULTIMATE.start_node_create_#res#1.base|)))) (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse8 |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 v_ArrVal_1832) .cse10 .cse1))) .cse1 v_ArrVal_1843)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (= v_ArrVal_1840 (let ((.cse18 (+ .cse16 8))) (store (select .cse0 .cse1) .cse18 (select v_ArrVal_1840 .cse18)))))))))) is different from false [2024-11-08 13:58:28,649 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse18 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1827)) (.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1829)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse15 (select .cse12 .cse10)) (.cse20 (select .cse18 .cse10)) (.cse16 (+ .cse19 4))) (let ((.cse0 (store (store |c_#memory_int#2| .cse10 v_ArrVal_1835) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1830)) (.cse3 (select .cse20 .cse16)) (.cse1 (select .cse15 .cse16))) (or (not (= (let ((.cse2 (+ .cse3 8))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1840 .cse2))) v_ArrVal_1840)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse13 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse7 (store (let ((.cse17 (store .cse20 .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| .cse10 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse18 .cse10 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13 .cse19) .cse14 .cse3))) .cse1 v_ArrVal_1841)) (.cse4 (store (let ((.cse11 (store .cse15 .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse10 .cse11) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse12 .cse10 .cse11) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13 v_ArrVal_1832) .cse14 .cse1))) .cse1 v_ArrVal_1843)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (+ 4 (select (select .cse7 .cse8) .cse9)))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6))))))))))) is different from false [2024-11-08 13:58:28,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 808 treesize of output 620 [2024-11-08 13:58:28,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 624 treesize of output 480 [2024-11-08 13:58:40,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_25| Int) (v_ArrVal_1822 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1820 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1832 Int) (v_ArrVal_1823 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1822)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820))) (let ((.cse9 (store .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_25| v_ArrVal_1829)) (.cse13 (store .cse11 |v_ULTIMATE.start_node_create_~temp~0#1.base_25| v_ArrVal_1827))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_1823)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1835) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| v_ArrVal_1830)) (.cse1 (select .cse10 .cse6)) (.cse14 (select .cse15 .cse6))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (let ((.cse12 (store .cse15 .cse6 0))) (store (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| (store (store (select (store .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12) |v_ULTIMATE.start_node_create_~temp~0#1.base_25|) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 4 .cse14))) .cse1 v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store .cse10 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_25|))) (store (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| (store (store (select (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) |v_ULTIMATE.start_node_create_~temp~0#1.base_25|) 8 v_ArrVal_1832) 4 .cse1))) .cse1 v_ArrVal_1843))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse4 (+ 4 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= (let ((.cse16 (+ .cse14 8))) (store (select .cse0 .cse1) .cse16 (select v_ArrVal_1840 .cse16))) v_ArrVal_1840)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_25|) 0)))))))) is different from false [2024-11-08 13:58:43,420 INFO L349 Elim1Store]: treesize reduction 155, result has 50.5 percent of original size [2024-11-08 13:58:43,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 179103 treesize of output 145555 [2024-11-08 13:58:46,986 INFO L349 Elim1Store]: treesize reduction 374, result has 47.7 percent of original size [2024-11-08 13:58:46,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 95353 treesize of output 94842 [2024-11-08 13:58:59,536 WARN L286 SmtUtils]: Spent 11.09s on a formula simplification. DAG size of input: 249 DAG size of output: 132 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 13:58:59,537 INFO L349 Elim1Store]: treesize reduction 1506, result has 28.9 percent of original size [2024-11-08 13:58:59,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 38 case distinctions, treesize of input 14628404 treesize of output 11900516 [2024-11-08 13:59:05,329 INFO L224 Elim1Store]: Index analysis took 157 ms [2024-11-08 13:59:05,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 795569 treesize of output 731656 [2024-11-08 13:59:21,024 WARN L286 SmtUtils]: Spent 15.03s on a formula simplification. DAG size of input: 2284 DAG size of output: 1880 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 13:59:21,573 INFO L224 Elim1Store]: Index analysis took 270 ms [2024-11-08 13:59:22,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:22,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 799607 treesize of output 783053