./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/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:24:37,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:24:37,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:24:37,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:24:37,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:24:37,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:24:37,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:24:37,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:24:37,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:24:37,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:24:37,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:24:37,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:24:37,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:24:37,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:24:37,704 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:24:37,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:24:37,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:24:37,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:24:37,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:24:37,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:24:37,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:24:37,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:24:37,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:24:37,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:24:37,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:24:37,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:24:37,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:24:37,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:24:37,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:24:37,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:24:37,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:24:37,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:24:37,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:24:37,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:24:37,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:24:37,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:24:37,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:24:37,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:24:37,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:24:37,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:24:37,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:24:37,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:24:37,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-10-12 18:24:37,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:24:38,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:24:38,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:24:38,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:24:38,019 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:24:38,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-12 18:24:39,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:24:39,748 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:24:39,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-12 18:24:39,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d1d20a6/73411d734aed4685b7ab55473f97fd0f/FLAG2fa2ccb71 [2024-10-12 18:24:39,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d1d20a6/73411d734aed4685b7ab55473f97fd0f [2024-10-12 18:24:39,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:24:39,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:24:39,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:24:39,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:24:39,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:24:39,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:24:39" (1/1) ... [2024-10-12 18:24:39,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7478ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:39, skipping insertion in model container [2024-10-12 18:24:39,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:24:39" (1/1) ... [2024-10-12 18:24:39,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:24:40,180 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/dll2n_append_equal.i[24333,24346] [2024-10-12 18:24:40,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:24:40,198 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:24:40,255 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/dll2n_append_equal.i[24333,24346] [2024-10-12 18:24:40,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:24:40,308 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:24:40,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40 WrapperNode [2024-10-12 18:24:40,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:24:40,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:24:40,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:24:40,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:24:40,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,398 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2024-10-12 18:24:40,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:24:40,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:24:40,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:24:40,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:24:40,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,434 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-10-12 18:24:40,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:24:40,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:24:40,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:24:40,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:24:40,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (1/1) ... [2024-10-12 18:24:40,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:24:40,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:40,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:24:40,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:24:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:24:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:24:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:24:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:24:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:24:40,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:24:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:24:40,536 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:24:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:24:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:24:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:24:40,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:24:40,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:24:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:24:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:24:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:24:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:24:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:24:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:24:40,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:24:40,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:24:40,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:24:40,878 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-12 18:24:40,878 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:24:40,918 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:24:40,918 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:24:40,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:24:40 BoogieIcfgContainer [2024-10-12 18:24:40,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:24:40,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:24:40,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:24:40,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:24:40,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:24:39" (1/3) ... [2024-10-12 18:24:40,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a40809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:24:40, skipping insertion in model container [2024-10-12 18:24:40,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:24:40" (2/3) ... [2024-10-12 18:24:40,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a40809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:24:40, skipping insertion in model container [2024-10-12 18:24:40,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:24:40" (3/3) ... [2024-10-12 18:24:40,928 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-10-12 18:24:40,946 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:24:40,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:24:41,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:24:41,016 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;@20cc78ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:24:41,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:24:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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-12 18:24:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:24:41,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:41,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:41,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:41,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1765087503, now seen corresponding path program 1 times [2024-10-12 18:24:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:41,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426970224] [2024-10-12 18:24:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:24:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:41,372 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-12 18:24:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426970224] [2024-10-12 18:24:41,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426970224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:41,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:41,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:24:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011806436] [2024-10-12 18:24:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:41,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:24:41,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:24:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:24:41,411 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-12 18:24:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:41,479 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2024-10-12 18:24:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:24:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2024-10-12 18:24:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:41,490 INFO L225 Difference]: With dead ends: 48 [2024-10-12 18:24:41,491 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 18:24:41,495 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-12 18:24:41,500 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:41,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:24:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 18:24:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 18:24:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-12 18:24:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-12 18:24:41,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2024-10-12 18:24:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:41,534 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-12 18:24:41,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-12 18:24:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-12 18:24:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:24:41,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:41,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:41,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:24:41,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:41,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 851795797, now seen corresponding path program 1 times [2024-10-12 18:24:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588341873] [2024-10-12 18:24:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:41,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:24:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:41,744 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-12 18:24:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588341873] [2024-10-12 18:24:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588341873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:24:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055348882] [2024-10-12 18:24:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:24:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:24:41,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:24:41,751 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-12 18:24:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:41,807 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-10-12 18:24:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:24:41,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-10-12 18:24:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:41,808 INFO L225 Difference]: With dead ends: 43 [2024-10-12 18:24:41,809 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 18:24:41,809 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-12 18:24:41,811 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:41,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:24:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 18:24:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-12 18:24:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-12 18:24:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-12 18:24:41,820 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2024-10-12 18:24:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:41,821 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-12 18:24:41,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-12 18:24:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-12 18:24:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:24:41,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:41,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:41,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:24:41,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:41,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash -853542195, now seen corresponding path program 1 times [2024-10-12 18:24:41,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:41,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160446109] [2024-10-12 18:24:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:24:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:24:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:24:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:42,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160446109] [2024-10-12 18:24:42,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160446109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:42,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:24:42,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:24:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119412371] [2024-10-12 18:24:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:24:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:24:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:24:42,035 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-12 18:24:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:42,099 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-12 18:24:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:24:42,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2024-10-12 18:24:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:42,102 INFO L225 Difference]: With dead ends: 47 [2024-10-12 18:24:42,102 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 18:24:42,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-12 18:24:42,103 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:42,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 18:24:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-12 18:24:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-12 18:24:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-12 18:24:42,114 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2024-10-12 18:24:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:42,114 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-12 18:24:42,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-12 18:24:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-12 18:24:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:24:42,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:42,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:24:42,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:24:42,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:42,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:42,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659445, now seen corresponding path program 1 times [2024-10-12 18:24:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298738881] [2024-10-12 18:24:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:24:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 18:24:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,288 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-12 18:24:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298738881] [2024-10-12 18:24:42,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298738881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:42,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073473956] [2024-10-12 18:24:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:42,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:42,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:42,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:24:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:42,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:24:42,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:42,522 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-12 18:24:42,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:42,572 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-12 18:24:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073473956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:24:42,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:24:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-12 18:24:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738315257] [2024-10-12 18:24:42,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:24:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:24:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:24:42,575 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-12 18:24:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:42,643 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-10-12 18:24:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:24:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 21 [2024-10-12 18:24:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:42,644 INFO L225 Difference]: With dead ends: 44 [2024-10-12 18:24:42,645 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:24:42,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 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-12 18:24:42,646 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:42,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:24:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:24:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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-12 18:24:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-12 18:24:42,657 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2024-10-12 18:24:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:42,657 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-12 18:24:42,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-12 18:24:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-12 18:24:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:24:42,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:42,659 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-12 18:24:42,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:24:42,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:42,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178627, now seen corresponding path program 1 times [2024-10-12 18:24:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591739970] [2024-10-12 18:24:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:24:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:24:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:24:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:24:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591739970] [2024-10-12 18:24:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591739970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804518645] [2024-10-12 18:24:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:43,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:43,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:43,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:43,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:24:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:43,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:24:43,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:43,654 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 15 treesize of output 1 [2024-10-12 18:24:43,682 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-12 18:24:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:24:43,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:24:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804518645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:43,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:24:43,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-10-12 18:24:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911265826] [2024-10-12 18:24:43,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:43,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 18:24:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:43,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 18:24:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:24:43,705 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:24:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:43,776 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-12 18:24:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:24:43,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-12 18:24:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:43,778 INFO L225 Difference]: With dead ends: 41 [2024-10-12 18:24:43,779 INFO L226 Difference]: Without dead ends: 38 [2024-10-12 18:24:43,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:24:43,780 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:43,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-12 18:24:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-10-12 18:24:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-12 18:24:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-12 18:24:43,787 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2024-10-12 18:24:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:43,789 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-12 18:24:43,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:24:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-12 18:24:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:24:43,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:43,790 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-12 18:24:43,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:24:43,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:43,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:43,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1775180301, now seen corresponding path program 1 times [2024-10-12 18:24:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:43,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413575078] [2024-10-12 18:24:43,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:24:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:44,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:24:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:24:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:24:44,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413575078] [2024-10-12 18:24:44,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413575078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:44,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692539237] [2024-10-12 18:24:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:44,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:44,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:44,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:44,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:24:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:44,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-12 18:24:44,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:44,556 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-12 18:24:44,670 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-12 18:24:44,680 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 15 treesize of output 1 [2024-10-12 18:24:44,731 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-12 18:24:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:24:44,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:24:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692539237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:24:44,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:24:44,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-10-12 18:24:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237543406] [2024-10-12 18:24:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:24:44,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:24:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:44,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:24:44,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:24:44,793 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:24:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:24:44,989 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-12 18:24:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 18:24:44,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-12 18:24:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:24:44,990 INFO L225 Difference]: With dead ends: 40 [2024-10-12 18:24:44,991 INFO L226 Difference]: Without dead ends: 38 [2024-10-12 18:24:44,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-12 18:24:44,992 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:24:44,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 112 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:24:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-12 18:24:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-10-12 18:24:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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-12 18:24:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-12 18:24:44,998 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2024-10-12 18:24:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:24:44,999 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-12 18:24:44,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:24:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-12 18:24:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:24:45,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:24:45,000 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, 1, 1] [2024-10-12 18:24:45,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:24:45,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:45,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:24:45,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:24:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash 846285726, now seen corresponding path program 1 times [2024-10-12 18:24:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:24:45,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105558589] [2024-10-12 18:24:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:24:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:24:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:45,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:24:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:24:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:24:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:24:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105558589] [2024-10-12 18:24:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105558589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:24:45,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815955742] [2024-10-12 18:24:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:24:45,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:24:45,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:24:45,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:24:45,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:24:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:24:45,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:24:45,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:24:45,823 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-12 18:24:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:24:45,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:24:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:24:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815955742] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:24:45,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:24:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-12 18:24:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632894661] [2024-10-12 18:24:45,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:24:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:24:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:24:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:24:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:24:45,882 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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-12 18:24:49,894 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-12 18:24:53,915 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-12 18:24:57,934 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-12 18:25:01,952 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-12 18:25:05,992 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-12 18:25:10,012 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-12 18:25:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:10,155 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-10-12 18:25:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:25:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 31 [2024-10-12 18:25:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:10,158 INFO L225 Difference]: With dead ends: 55 [2024-10-12 18:25:10,158 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:25:10,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-12 18:25:10,159 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:10,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-10-12 18:25:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:25:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:25:10,170 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-12 18:25:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-12 18:25:10,172 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 31 [2024-10-12 18:25:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-12 18:25:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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-12 18:25:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-12 18:25:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:25:10,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:10,175 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, 1, 1, 1] [2024-10-12 18:25:10,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:25:10,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:10,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2018592169, now seen corresponding path program 1 times [2024-10-12 18:25:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189036999] [2024-10-12 18:25:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:25:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:25:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:10,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:25:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:25:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189036999] [2024-10-12 18:25:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189036999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438285441] [2024-10-12 18:25:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:10,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:10,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:10,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:25:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:10,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 18:25:10,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:10,983 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-12 18:25:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:10,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:25:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438285441] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:25:11,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:25:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-10-12 18:25:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216150229] [2024-10-12 18:25:11,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:25:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:11,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:25:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:25:11,041 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:25:15,053 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-12 18:25:19,082 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-12 18:25:23,095 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-12 18:25:27,106 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-12 18:25:31,141 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-12 18:25:35,164 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-12 18:25:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:35,276 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-12 18:25:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 18:25:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-12 18:25:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:35,277 INFO L225 Difference]: With dead ends: 38 [2024-10-12 18:25:35,277 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:25:35,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-12 18:25:35,278 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:35,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 138 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-12 18:25:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:25:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-10-12 18:25:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-12 18:25:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-12 18:25:35,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2024-10-12 18:25:35,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:35,285 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-12 18:25:35,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:25:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-12 18:25:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:25:35,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:35,287 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, 1, 1, 1] [2024-10-12 18:25:35,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 18:25:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:35,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2018590495, now seen corresponding path program 1 times [2024-10-12 18:25:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816923362] [2024-10-12 18:25:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:25:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:36,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:25:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:25:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:37,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816923362] [2024-10-12 18:25:37,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816923362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470637344] [2024-10-12 18:25:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:37,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:37,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:25:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:37,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-12 18:25:37,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:37,462 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-12 18:25:37,809 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:25:37,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:25:37,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:25:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:25:38,201 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 11 treesize of output 3 [2024-10-12 18:25:38,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:25:38,368 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-12 18:25:38,369 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-12 18:25:38,411 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:25:38,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-12 18:25:38,714 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 59 treesize of output 26 [2024-10-12 18:25:38,722 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-10-12 18:25:38,804 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-12 18:25:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:25:38,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:38,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1424) (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|))) (not (= v_ArrVal_1423 (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1423 .cse0))))))) is different from false [2024-10-12 18:25:38,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= v_ArrVal_1423 (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1423 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1423) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1424) (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-12 18:25:38,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (not (= v_ArrVal_1423 (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_1423 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1423) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1424) (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-12 18:25:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470637344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:39,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:25:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2024-10-12 18:25:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199407594] [2024-10-12 18:25:39,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:39,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-12 18:25:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-12 18:25:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1925, Unknown=3, NotChecked=270, Total=2352 [2024-10-12 18:25:39,045 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:39,990 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-10-12 18:25:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-12 18:25:39,991 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2024-10-12 18:25:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:39,991 INFO L225 Difference]: With dead ends: 48 [2024-10-12 18:25:39,991 INFO L226 Difference]: Without dead ends: 46 [2024-10-12 18:25:39,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=3270, Unknown=3, NotChecked=354, Total=3906 [2024-10-12 18:25:39,993 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:39,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 277 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:25:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-12 18:25:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2024-10-12 18:25:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-12 18:25:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-12 18:25:40,001 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2024-10-12 18:25:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:40,001 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-12 18:25:40,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-12 18:25:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 18:25:40,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:40,003 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, 1, 1, 1, 1, 1] [2024-10-12 18:25:40,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:25:40,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:40,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:40,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1459785074, now seen corresponding path program 1 times [2024-10-12 18:25:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:40,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548874772] [2024-10-12 18:25:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:25:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:25:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:25:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:25:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:41,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548874772] [2024-10-12 18:25:41,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548874772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:41,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480172962] [2024-10-12 18:25:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:41,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:41,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:41,277 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:41,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 18:25:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:41,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-12 18:25:41,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:41,503 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-12 18:25:41,740 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:25:41,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:25:41,798 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 13 treesize of output 9 [2024-10-12 18:25:41,862 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-12 18:25:41,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-10-12 18:25:42,015 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 60 treesize of output 18 [2024-10-12 18:25:42,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:25:42,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:42,151 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 68 treesize of output 51 [2024-10-12 18:25:42,172 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-12 18:25:42,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-10-12 18:25:42,348 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-10-12 18:25:42,349 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2024-10-12 18:25:42,372 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-12 18:25:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 92 [2024-10-12 18:25:42,479 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 48 treesize of output 32 [2024-10-12 18:25:42,504 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 36 treesize of output 24 [2024-10-12 18:25:42,556 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 30 treesize of output 12 [2024-10-12 18:25:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:25:42,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480172962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:42,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:25:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2024-10-12 18:25:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756815540] [2024-10-12 18:25:42,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:42,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-12 18:25:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 18:25:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1938, Unknown=9, NotChecked=0, Total=2070 [2024-10-12 18:25:42,965 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 41 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 18:25:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:44,260 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-12 18:25:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 18:25:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-12 18:25:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:44,262 INFO L225 Difference]: With dead ends: 53 [2024-10-12 18:25:44,262 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 18:25:44,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=292, Invalid=3859, Unknown=9, NotChecked=0, Total=4160 [2024-10-12 18:25:44,264 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:44,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 417 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 18:25:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 18:25:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-10-12 18:25:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-12 18:25:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-12 18:25:44,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2024-10-12 18:25:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:44,279 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-12 18:25:44,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 33 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-12 18:25:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-12 18:25:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 18:25:44,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:44,282 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:44,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:25:44,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:44,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:44,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1013232572, now seen corresponding path program 1 times [2024-10-12 18:25:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951191221] [2024-10-12 18:25:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:25:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:25:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:25:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951191221] [2024-10-12 18:25:46,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951191221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089906606] [2024-10-12 18:25:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:46,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:46,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 18:25:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:47,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-12 18:25:47,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:47,058 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-12 18:25:47,349 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:25:47,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:25:47,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:25:47,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:25:47,500 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:25:47,501 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 50 treesize of output 45 [2024-10-12 18:25:47,509 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-12 18:25:47,746 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 30 treesize of output 14 [2024-10-12 18:25:47,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:25:47,763 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-12 18:25:47,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:47,996 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 38 treesize of output 27 [2024-10-12 18:25:48,009 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:25:48,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:25:48,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:25:48,323 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 40 treesize of output 16 [2024-10-12 18:25:48,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-10-12 18:25:48,547 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-12 18:25:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:25:48,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089906606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:49,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:25:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2024-10-12 18:25:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962690015] [2024-10-12 18:25:49,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:49,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-12 18:25:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-12 18:25:49,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2701, Unknown=100, NotChecked=0, Total=2970 [2024-10-12 18:25:49,156 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 40 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:50,922 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-12 18:25:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 18:25:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 40 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-10-12 18:25:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:50,924 INFO L225 Difference]: With dead ends: 53 [2024-10-12 18:25:50,924 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 18:25:50,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=363, Invalid=5233, Unknown=104, NotChecked=0, Total=5700 [2024-10-12 18:25:50,927 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:50,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 366 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 18:25:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 18:25:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2024-10-12 18:25:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-12 18:25:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-12 18:25:50,940 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2024-10-12 18:25:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:50,940 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-12 18:25:50,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 40 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-12 18:25:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:25:50,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:50,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:50,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 18:25:51,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 18:25:51,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1241039849, now seen corresponding path program 1 times [2024-10-12 18:25:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788028282] [2024-10-12 18:25:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:25:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:25:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:25:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:54,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788028282] [2024-10-12 18:25:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788028282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324259032] [2024-10-12 18:25:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:54,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:54,086 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:54,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 18:25:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:54,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 166 conjuncts are in the unsatisfiable core [2024-10-12 18:25:54,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:54,605 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-12 18:25:54,615 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-12 18:25:54,680 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 26 treesize of output 11 [2024-10-12 18:25:54,896 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:25:54,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:25:54,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:25:54,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:25:54,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:25:54,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:25:55,058 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-12 18:25:55,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2024-10-12 18:25:55,062 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-12 18:25:55,070 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-12 18:25:55,288 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 45 treesize of output 21 [2024-10-12 18:25:55,292 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-12 18:25:55,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:25:55,301 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-12 18:25:55,435 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-12 18:25:55,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:55,560 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 53 treesize of output 36 [2024-10-12 18:25:55,575 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:25:55,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:25:55,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-12 18:25:55,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-12 18:25:56,283 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-12 18:25:56,283 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 107 [2024-10-12 18:25:56,313 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-10-12 18:25:56,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 293 treesize of output 160 [2024-10-12 18:25:56,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:56,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 72 [2024-10-12 18:25:56,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:56,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2024-10-12 18:25:56,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 65 [2024-10-12 18:25:56,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2024-10-12 18:25:56,355 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2024-10-12 18:25:56,467 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 112 treesize of output 76 [2024-10-12 18:25:56,575 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:25:56,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 40 [2024-10-12 18:25:56,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:25:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:25:56,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:56,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2178 Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_2174 .cse0)) v_ArrVal_2174)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (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 (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_2174))) (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_2178))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2176) .cse2) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2180) .cse2) .cse3))))))) is different from false [2024-10-12 18:25:57,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:25:57,659 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 298 [2024-10-12 18:25:57,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2193 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~new_last~0#1.offset_26| Int) (v_ArrVal_2178 Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2193)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2191)) (.cse3 (select (select .cse4 .cse8) .cse9))) (let ((.cse2 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_arrayElimArr_5)) (.cse0 (select .cse7 .cse3)) (.cse1 (+ (select (select .cse7 .cse8) .cse9) 4))) (or (not (= 0 (select .cse0 .cse1))) (not (= (select v_arrayElimArr_5 0) |c_ULTIMATE.start_dll_append_~data#1|)) (not (= v_ArrVal_2174 (store (select .cse2 .cse3) .cse1 (select v_ArrVal_2174 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (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 (store |c_#memory_int#1| .cse3 v_ArrVal_2174) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| (store (select (store .cse2 .cse3 v_ArrVal_2174) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.offset_26| 8) v_ArrVal_2178)) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse3 (store (select .cse4 .cse3) .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2176) .cse5) .cse6)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_~new_last~0#1.offset_26|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2180) .cse5) .cse6)))) (< |v_ULTIMATE.start_dll_append_~new_last~0#1.offset_26| 0)))))) is different from false [2024-10-12 18:25:57,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324259032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:57,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:25:57,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 51 [2024-10-12 18:25:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682278895] [2024-10-12 18:25:57,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:57,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-12 18:25:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-12 18:25:57,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3111, Unknown=3, NotChecked=226, Total=3540 [2024-10-12 18:25:57,696 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 51 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 41 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:59,733 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-10-12 18:25:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 18:25:59,734 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 41 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-10-12 18:25:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:59,735 INFO L225 Difference]: With dead ends: 54 [2024-10-12 18:25:59,735 INFO L226 Difference]: Without dead ends: 52 [2024-10-12 18:25:59,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=372, Invalid=5485, Unknown=3, NotChecked=302, Total=6162 [2024-10-12 18:25:59,737 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:59,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 313 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:25:59,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-12 18:25:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-10-12 18:25:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-12 18:25:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-10-12 18:25:59,746 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 36 [2024-10-12 18:25:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:59,747 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-12 18:25:59,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 41 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-10-12 18:25:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:25:59,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:59,748 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:59,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 18:25:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:59,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1687594025, now seen corresponding path program 2 times [2024-10-12 18:25:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612759111] [2024-10-12 18:25:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 18:26:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 18:26:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:26:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612759111] [2024-10-12 18:26:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612759111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640763338] [2024-10-12 18:26:02,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:26:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:02,410 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:02,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 18:26:02,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:26:02,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:26:02,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-10-12 18:26:02,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:02,729 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-12 18:26:02,845 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-12 18:26:02,850 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-12 18:26:03,182 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:26:03,182 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 16 treesize of output 15 [2024-10-12 18:26:03,206 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:26:03,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:26:03,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:26:03,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-12 18:26:03,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:26:03,293 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 17 treesize of output 19 [2024-10-12 18:26:03,298 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 8 treesize of output 7 [2024-10-12 18:26:03,373 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 18:26:03,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 63 [2024-10-12 18:26:03,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-10-12 18:26:03,680 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-12 18:26:03,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-10-12 18:26:03,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 18:26:03,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-12 18:26:03,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:03,973 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:26:03,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-10-12 18:26:03,998 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-12 18:26:03,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-10-12 18:26:04,029 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-12 18:26:04,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 18:26:04,448 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-10-12 18:26:04,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 31 [2024-10-12 18:26:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:26:04,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640763338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:04,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:26:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 49 [2024-10-12 18:26:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330905272] [2024-10-12 18:26:04,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:04,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-12 18:26:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-12 18:26:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2715, Unknown=0, NotChecked=0, Total=2862 [2024-10-12 18:26:04,974 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 49 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 39 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)