./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:44:35,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:44:35,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:44:35,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:44:35,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:44:35,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:44:35,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:44:35,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:44:35,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:44:35,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:44:35,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:44:35,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:44:35,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:44:35,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:44:35,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:44:35,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:44:35,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:44:35,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:44:35,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:44:35,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:44:35,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:44:35,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:44:35,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:44:35,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:44:35,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:44:35,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:44:35,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:44:35,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:44:35,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:44:35,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:44:35,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:44:35,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:44:35,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:44:35,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:44:35,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:44:35,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:44:35,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:44:35,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:44:35,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:44:35,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:44:35,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:44:35,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:44:35,501 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-clean/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-clean/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-10-11 01:44:35,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:44:35,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:44:35,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:44:35,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:44:35,771 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:44:35,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-10-11 01:44:37,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:44:37,531 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:44:37,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-10-11 01:44:37,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0aa9037ef/51699cdaf81146d1abbbb51b9eba3755/FLAG578d78eaf [2024-10-11 01:44:37,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0aa9037ef/51699cdaf81146d1abbbb51b9eba3755 [2024-10-11 01:44:37,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:44:37,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:44:37,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:44:37,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:44:37,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:44:37,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:37" (1/1) ... [2024-10-11 01:44:37,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac50db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:37, skipping insertion in model container [2024-10-11 01:44:37,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:37" (1/1) ... [2024-10-11 01:44:37,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:44:38,208 WARN L248 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/sll2n_insert_unequal.i[24620,24633] [2024-10-11 01:44:38,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:44:38,226 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:44:38,269 WARN L248 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/sll2n_insert_unequal.i[24620,24633] [2024-10-11 01:44:38,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:44:38,303 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:44:38,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38 WrapperNode [2024-10-11 01:44:38,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:44:38,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:44:38,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:44:38,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:44:38,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,352 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2024-10-11 01:44:38,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:44:38,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:44:38,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:44:38,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:44:38,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,388 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-11 01:44:38,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:44:38,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:44:38,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:44:38,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:44:38,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (1/1) ... [2024-10-11 01:44:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:44:38,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:38,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:44:38,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:44:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:44:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:44:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:44:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:44:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:44:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:44:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:44:38,505 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:44:38,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:44:38,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:44:38,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:44:38,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:44:38,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:44:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:44:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:44:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:44:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:44:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:44:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:44:38,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:44:38,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:44:38,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:44:38,853 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-11 01:44:38,854 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:44:38,937 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:44:38,937 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 01:44:38,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:38 BoogieIcfgContainer [2024-10-11 01:44:38,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:44:38,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:44:38,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:44:38,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:44:38,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:44:37" (1/3) ... [2024-10-11 01:44:38,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a0c457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:38, skipping insertion in model container [2024-10-11 01:44:38,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:38" (2/3) ... [2024-10-11 01:44:38,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a0c457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:38, skipping insertion in model container [2024-10-11 01:44:38,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:38" (3/3) ... [2024-10-11 01:44:38,974 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-10-11 01:44:38,991 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:44:38,991 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:44:39,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:44:39,054 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;@52773266, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:44:39,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:44:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:44:39,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:39,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:39,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -28865109, now seen corresponding path program 1 times [2024-10-11 01:44:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:39,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271440051] [2024-10-11 01:44:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:39,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:39,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 01:44:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271440051] [2024-10-11 01:44:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271440051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:39,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:44:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912445472] [2024-10-11 01:44:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:39,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:44:39,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:39,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:44:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:44:39,419 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:39,489 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2024-10-11 01:44:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:44:39,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 01:44:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:39,501 INFO L225 Difference]: With dead ends: 50 [2024-10-11 01:44:39,501 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 01:44:39,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-11 01:44:39,508 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 01:44:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 01:44:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-10-11 01:44:39,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 14 [2024-10-11 01:44:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:39,555 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-11 01:44:39,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-10-11 01:44:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:44:39,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:39,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:44:39,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2091124953, now seen corresponding path program 1 times [2024-10-11 01:44:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941315829] [2024-10-11 01:44:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 01:44:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941315829] [2024-10-11 01:44:39,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941315829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:39,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:39,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:44:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114567930] [2024-10-11 01:44:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:39,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:44:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:39,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:44:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:44:39,741 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:39,795 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2024-10-11 01:44:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:44:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 01:44:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:39,797 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:44:39,798 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 01:44:39,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:44:39,799 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:39,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 01:44:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-11 01:44:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-11 01:44:39,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2024-10-11 01:44:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:39,812 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-11 01:44:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-11 01:44:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:44:39,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:39,814 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:39,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:44:39,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:39,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2115192704, now seen corresponding path program 1 times [2024-10-11 01:44:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771913343] [2024-10-11 01:44:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:44:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771913343] [2024-10-11 01:44:40,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771913343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076900999] [2024-10-11 01:44:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:40,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:40,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:44:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:44:40,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:40,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076900999] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:40,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-11 01:44:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195677650] [2024-10-11 01:44:40,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:44:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:44:40,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:40,359 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:40,427 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-10-11 01:44:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:44:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2024-10-11 01:44:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:40,428 INFO L225 Difference]: With dead ends: 44 [2024-10-11 01:44:40,428 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:44:40,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:40,430 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:40,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:44:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:44:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-11 01:44:40,438 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 20 [2024-10-11 01:44:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:40,439 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-11 01:44:40,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-10-11 01:44:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:44:40,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:40,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:40,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:44:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:40,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1441189607, now seen corresponding path program 2 times [2024-10-11 01:44:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690322315] [2024-10-11 01:44:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:40,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:44:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690322315] [2024-10-11 01:44:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690322315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:44:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825029891] [2024-10-11 01:44:40,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:44:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:44:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:44:40,790 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:44:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:40,848 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2024-10-11 01:44:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:44:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-11 01:44:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:40,849 INFO L225 Difference]: With dead ends: 38 [2024-10-11 01:44:40,849 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:44:40,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:44:40,850 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:40,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:44:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 01:44:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-11 01:44:40,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 26 [2024-10-11 01:44:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:40,856 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-11 01:44:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:44:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-11 01:44:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:44:40,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:40,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:40,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:44:40,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:40,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1439342565, now seen corresponding path program 1 times [2024-10-11 01:44:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586641397] [2024-10-11 01:44:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:41,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586641397] [2024-10-11 01:44:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586641397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439152122] [2024-10-11 01:44:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:41,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:41,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:41,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:44:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:41,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:44:41,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:44:41,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:44:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439152122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:41,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:44:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-11 01:44:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890827492] [2024-10-11 01:44:41,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:41,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:44:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:44:41,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:41,380 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:41,420 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-10-11 01:44:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:44:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-11 01:44:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:41,422 INFO L225 Difference]: With dead ends: 40 [2024-10-11 01:44:41,422 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 01:44:41,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:44:41,424 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:41,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 01:44:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-11 01:44:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 01:44:41,434 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 26 [2024-10-11 01:44:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:41,434 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 01:44:41,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 01:44:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:44:41,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:41,435 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:41,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:44:41,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:41,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:41,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash -262117536, now seen corresponding path program 1 times [2024-10-11 01:44:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077444679] [2024-10-11 01:44:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:42,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077444679] [2024-10-11 01:44:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077444679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074208840] [2024-10-11 01:44:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:43,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:43,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:44:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-11 01:44:43,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:43,418 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-10-11 01:44:43,432 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:44:43,508 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 23 treesize of output 11 [2024-10-11 01:44:43,638 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 9 treesize of output 3 [2024-10-11 01:44:43,643 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 11 treesize of output 3 [2024-10-11 01:44:43,854 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:44:43,855 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-11 01:44:43,894 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 01:44:43,894 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 15 treesize of output 15 [2024-10-11 01:44:44,171 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-10-11 01:44:44,250 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-10-11 01:44:44,257 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-10-11 01:44:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:44,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:46,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_614 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (+ 4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_614))) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_616) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-11 01:44:46,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074208840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:46,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:46,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-10-11 01:44:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375363084] [2024-10-11 01:44:46,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 01:44:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 01:44:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=992, Unknown=37, NotChecked=64, Total=1190 [2024-10-11 01:44:46,390 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 01:44:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:56,428 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-10-11 01:44:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 01:44:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2024-10-11 01:44:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:56,429 INFO L225 Difference]: With dead ends: 41 [2024-10-11 01:44:56,429 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 01:44:56,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=133, Invalid=1469, Unknown=42, NotChecked=78, Total=1722 [2024-10-11 01:44:56,431 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:56,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 223 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:44:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 01:44:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-10-11 01:44:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-10-11 01:44:56,440 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 27 [2024-10-11 01:44:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:56,441 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-10-11 01:44:56,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 01:44:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-10-11 01:44:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:44:56,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:56,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:56,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:44:56,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:56,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:56,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash -260270494, now seen corresponding path program 1 times [2024-10-11 01:44:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419508122] [2024-10-11 01:44:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:56,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:44:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419508122] [2024-10-11 01:44:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419508122] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117165811] [2024-10-11 01:44:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:56,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:56,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:44:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:57,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:44:57,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:57,161 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-10-11 01:44:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:57,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:44:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117165811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:57,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:57,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 14 [2024-10-11 01:44:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440090284] [2024-10-11 01:44:57,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:57,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 01:44:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:57,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 01:44:57,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:44:57,228 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 01:45:01,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:05,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:09,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:13,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:17,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:21,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:25,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:25,455 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2024-10-11 01:45:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:45:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 27 [2024-10-11 01:45:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:25,460 INFO L225 Difference]: With dead ends: 55 [2024-10-11 01:45:25,460 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 01:45:25,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:45:25,461 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:25,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 243 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2024-10-11 01:45:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 01:45:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-10-11 01:45:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-10-11 01:45:25,472 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 27 [2024-10-11 01:45:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:25,473 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-10-11 01:45:25,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 01:45:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-10-11 01:45:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:45:25,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:25,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:25,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:45:25,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 01:45:25,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash 464236054, now seen corresponding path program 1 times [2024-10-11 01:45:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2638611] [2024-10-11 01:45:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:26,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:45:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2638611] [2024-10-11 01:45:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2638611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522488556] [2024-10-11 01:45:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:26,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:26,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:26,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:26,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:45:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:26,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 01:45:26,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:26,333 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-10-11 01:45:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:45:26,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:45:26,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522488556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:45:26,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:45:26,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2024-10-11 01:45:26,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196936698] [2024-10-11 01:45:26,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:26,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 01:45:26,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 01:45:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:45:26,446 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 01:45:30,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:34,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:38,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:42,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:46,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:50,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:54,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:54,671 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-10-11 01:45:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:45:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-10-11 01:45:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:54,673 INFO L225 Difference]: With dead ends: 55 [2024-10-11 01:45:54,673 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 01:45:54,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-10-11 01:45:54,674 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:54,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 257 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2024-10-11 01:45:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 01:45:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2024-10-11 01:45:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-10-11 01:45:54,688 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2024-10-11 01:45:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:54,689 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-11 01:45:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 01:45:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-10-11 01:45:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:45:54,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:54,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:54,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:45:54,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:54,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:54,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1929378297, now seen corresponding path program 2 times [2024-10-11 01:45:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386380117] [2024-10-11 01:45:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:45:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386380117] [2024-10-11 01:45:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386380117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502202370] [2024-10-11 01:45:55,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:45:55,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:55,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:55,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:55,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:45:55,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:45:55,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:55,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 01:45:55,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:45:55,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:45:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502202370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:45:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-10-11 01:45:55,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49334916] [2024-10-11 01:45:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:45:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:55,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:45:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:45:55,301 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:55,336 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-10-11 01:45:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:45:55,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 01:45:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:55,337 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:45:55,338 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 01:45:55,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:45:55,338 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:55,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 01:45:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-11 01:45:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-11 01:45:55,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 28 [2024-10-11 01:45:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:55,346 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-11 01:45:55,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:45:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-11 01:45:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:45:55,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:55,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:55,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 01:45:55,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 01:45:55,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1508130747, now seen corresponding path program 1 times [2024-10-11 01:45:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848122727] [2024-10-11 01:45:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:45:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848122727] [2024-10-11 01:45:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848122727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:55,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326644117] [2024-10-11 01:45:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:55,832 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:55,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:45:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:56,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 01:45:56,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:45:56,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:45:56,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326644117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:45:56,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:45:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-11 01:45:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257767567] [2024-10-11 01:45:56,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:56,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 01:45:56,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 01:45:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 01:45:56,148 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:45:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:56,290 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-11 01:45:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 01:45:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-10-11 01:45:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:56,291 INFO L225 Difference]: With dead ends: 42 [2024-10-11 01:45:56,291 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 01:45:56,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:45:56,292 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:56,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 100 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:45:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 01:45:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-11 01:45:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-11 01:45:56,298 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2024-10-11 01:45:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:56,299 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-11 01:45:56,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:45:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-11 01:45:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 01:45:56,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:56,300 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:56,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 01:45:56,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:56,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -492642021, now seen corresponding path program 1 times [2024-10-11 01:45:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:56,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667081862] [2024-10-11 01:45:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:57,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:45:57,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:57,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667081862] [2024-10-11 01:45:57,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667081862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:57,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149934517] [2024-10-11 01:45:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:57,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:57,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 01:45:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:57,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-11 01:45:57,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:58,020 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-10-11 01:45:58,161 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 9 treesize of output 3 [2024-10-11 01:45:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:45:58,313 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 01:45:58,313 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 15 treesize of output 15 [2024-10-11 01:45:58,575 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 19 treesize of output 11 [2024-10-11 01:45:58,583 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 19 treesize of output 11 [2024-10-11 01:45:58,595 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-10-11 01:45:58,665 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 137 treesize of output 89 [2024-10-11 01:45:58,687 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:45:58,687 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 79 treesize of output 68 [2024-10-11 01:45:58,692 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-10-11 01:45:58,699 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-10-11 01:45:58,754 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 27 treesize of output 15 [2024-10-11 01:45:58,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 01:45:58,840 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-10-11 01:45:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:45:58,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:58,898 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1429 (Array Int Int))) (or (not (= v_ArrVal_1428 (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_1428 .cse0))))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1429) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) .cse1) .cse2))) |c_ULTIMATE.start_main_~uneq~0#1|))) is different from false [2024-10-11 01:45:58,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:58,915 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 67 treesize of output 68 [2024-10-11 01:45:58,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:58,931 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 130 treesize of output 129 [2024-10-11 01:45:58,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:58,944 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 106 treesize of output 96 [2024-10-11 01:45:58,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:58,961 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 176 treesize of output 161 [2024-10-11 01:45:58,970 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 37 treesize of output 29 [2024-10-11 01:45:58,976 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 29 treesize of output 21 [2024-10-11 01:45:59,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse11 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse14))) (let ((.cse3 (not .cse11)) (.cse4 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (or (not (= v_ArrVal_1428 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|))))) (let ((.cse7 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse0 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_23 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (let ((.cse21 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428))) (or (not (= (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select .cse21 v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_23) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))))) (.cse1 (or .cse11 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_23 Int)) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_23) v_arrayElimCell_25)) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428))))))) (.cse5 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_23 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_23) v_arrayElimCell_25)) (not (= (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select .cse17 v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse6 (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (or (not (= (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_23) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) .cse11)) (.cse12 (or .cse3 .cse4)) (.cse10 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_27 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1428 v_arrayElimCell_25)) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse2 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse14))) (and (or (and .cse0 .cse1 (or .cse2 .cse3 .cse4) .cse5 .cse6) .cse7) (or .cse3 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (or (not (= (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or (and .cse10 (or .cse11 (forall ((v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_DerPreprocessor_3) v_arrayElimCell_25) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse7) (or .cse2 (and .cse0 .cse12 .cse1 .cse5 .cse6)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1428 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or (forall ((v_ArrVal_1425 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) .cse11) (or (and .cse12 .cse10 (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse9 v_DerPreprocessor_2) v_arrayElimCell_25))) .cse11)) .cse2)))))) is different from false [2024-10-11 01:45:59,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse15)) (.cse10 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse7 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (or (not (= v_ArrVal_1428 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse8 (not .cse11))) (let ((.cse1 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_23 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (let ((.cse21 (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428))) (or (not (= (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_23) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (= (select (select .cse21 v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse2 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_23 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428))) (or (not (= (store (select .cse18 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_23) v_arrayElimCell_25)) (= (select (select .cse19 v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse3 (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_23 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_23) v_arrayElimCell_25))))) .cse11)) (.cse5 (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (or (not (= (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_23) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))))) .cse11)) (.cse6 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse15)) (.cse9 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_27 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1428 v_arrayElimCell_25)) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse4 (or .cse7 .cse8))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse6 (and .cse1 .cse2 (or .cse7 .cse8 .cse0) .cse3 .cse5)) (or .cse6 (and .cse9 (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_3) v_arrayElimCell_25))) .cse11))) (or (forall ((v_ArrVal_1425 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) .cse11) (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (or (not (= (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse8) (or .cse0 (and .cse9 (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_2) v_arrayElimCell_25) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse11) .cse4)) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1428 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse10 (select v_ArrVal_1428 .cse10)) v_ArrVal_1428)) (= (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28) |c_ULTIMATE.start_main_~uneq~0#1|))))))))) is different from false [2024-10-11 01:46:00,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse16)) (.cse9 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse10 v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28))))) (.cse2 (not .cse13))) (let ((.cse3 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_23 Int)) (let ((.cse21 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (let ((.cse22 (store .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428))) (or (not (= (store (select .cse21 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_23) v_arrayElimCell_25)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse22 v_arrayElimCell_27) v_arrayElimCell_28))))))) (.cse4 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_arrayElimCell_23 Int)) (let ((.cse19 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (let ((.cse20 (store .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428))) (or (not (= (store (select .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select .cse20 v_arrayElimCell_23) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_27) v_arrayElimCell_28))))))) (.cse5 (or .cse13 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_arrayElimCell_23 Int)) (let ((.cse18 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (or (not (= (store (select .cse18 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) v_arrayElimCell_23) v_arrayElimCell_25))))))) (.cse6 (or .cse13 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse17 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) v_arrayElimCell_23) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse0 (= .cse10 .cse16)) (.cse11 (or .cse1 .cse2)) (.cse12 (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_27 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1428 v_arrayElimCell_25)) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28)))))) (.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)))) (and (or (and (or .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6) .cse7) (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse8 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (or (not (= (store (select .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1428 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28))))) (or (and .cse11 .cse3 .cse4 .cse5 .cse6) .cse0) (or .cse0 (and .cse12 .cse11 (or .cse13 (forall ((v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse10 v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 v_DerPreprocessor_2) v_arrayElimCell_25)))))) (or (forall ((v_ArrVal_1428 (Array Int Int)) (v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse10 v_ArrVal_1425))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 (select v_ArrVal_1428 .cse9)) v_ArrVal_1428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1428) v_arrayElimCell_27) v_arrayElimCell_28))))) .cse2) (or (and .cse12 (or .cse13 (forall ((v_ArrVal_1425 (Array Int Int)) (v_arrayElimCell_25 Int) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse10 v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse9 v_DerPreprocessor_3) v_arrayElimCell_25))))) .cse7) (or .cse13 (forall ((v_ArrVal_1425 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse10 v_ArrVal_1425) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))))))))) is different from false [2024-10-11 01:46:02,810 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-10-11 01:46:02,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2499 treesize of output 2688 [2024-10-11 01:46:03,190 INFO L224 Elim1Store]: Index analysis took 166 ms [2024-10-11 01:46:05,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:05,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2143 treesize of output 3593 [2024-10-11 01:46:06,937 INFO L349 Elim1Store]: treesize reduction 24, result has 61.9 percent of original size [2024-10-11 01:46:06,938 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1934 treesize of output 1964 [2024-10-11 01:46:07,517 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-10-11 01:46:07,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1925 treesize of output 1938 [2024-10-11 01:46:08,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:46:08,224 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 2 case distinctions, treesize of input 1918 treesize of output 1926 [2024-10-11 01:46:09,271 INFO L349 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2024-10-11 01:46:09,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 1913 treesize of output 1930 [2024-10-11 01:46:10,381 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 1906 treesize of output 1904