./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stack-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:01:21,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:01:21,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:01:21,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:01:21,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:01:21,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:01:21,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:01:21,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:01:21,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:01:21,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:01:21,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:01:21,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:01:21,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:01:21,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:01:21,407 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:01:21,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:01:21,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:01:21,408 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:01:21,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:01:21,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:01:21,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:01:21,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:01:21,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:21,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:21,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:01:21,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:01:21,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:01:21,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2025-01-09 05:01:21,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:01:21,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:01:21,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:01:21,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:01:21,635 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:01:21,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-01-09 05:01:22,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40cd23a76/f29e5ec49e45454184ab467a3305c821/FLAG6545ae72d [2025-01-09 05:01:23,098 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:01:23,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-01-09 05:01:23,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40cd23a76/f29e5ec49e45454184ab467a3305c821/FLAG6545ae72d [2025-01-09 05:01:23,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40cd23a76/f29e5ec49e45454184ab467a3305c821 [2025-01-09 05:01:23,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:01:23,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:01:23,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:01:23,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:01:23,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:01:23,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@918a2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23, skipping insertion in model container [2025-01-09 05:01:23,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:01:23,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-01-09 05:01:23,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:01:23,740 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:01:23,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-01-09 05:01:23,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:01:23,849 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:01:23,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23 WrapperNode [2025-01-09 05:01:23,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:01:23,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:01:23,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:01:23,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:01:23,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,895 INFO L138 Inliner]: procedures = 252, calls = 297, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 644 [2025-01-09 05:01:23,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:01:23,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:01:23,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:01:23,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:01:23,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,941 INFO L175 MemorySlicer]: Split 148 memory accesses to 18 slices as follows [2, 8, 8, 8, 20, 12, 10, 0, 8, 6, 2, 4, 4, 20, 6, 2, 6, 22]. 15 percent of accesses are in the largest equivalence class. The 51 initializations are split as follows [2, 3, 3, 3, 6, 6, 2, 0, 2, 2, 0, 2, 0, 10, 0, 0, 0, 10]. The 33 writes are split as follows [0, 2, 2, 2, 8, 3, 3, 0, 3, 2, 0, 0, 2, 0, 0, 0, 0, 6]. [2025-01-09 05:01:23,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:23,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:24,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:01:24,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:01:24,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:01:24,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:01:24,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (1/1) ... [2025-01-09 05:01:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:24,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:24,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:01:24,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:01:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:01:24,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:01:24,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-01-09 05:01:24,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:01:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 05:01:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-01-09 05:01:24,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:01:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:01:24,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-01-09 05:01:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 05:01:24,062 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:01:24,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:01:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:01:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:01:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:01:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 05:01:24,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:01:24,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:01:24,247 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:01:24,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:01:24,275 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,276 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-01-09 05:01:24,634 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##50: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##51: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:24,635 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-01-09 05:01:24,636 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:01:24,636 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,636 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:24,651 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:01:25,042 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-01-09 05:01:25,042 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:01:25,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:01:25,055 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:01:25,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:25 BoogieIcfgContainer [2025-01-09 05:01:25,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:01:25,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:01:25,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:01:25,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:01:25,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:01:23" (1/3) ... [2025-01-09 05:01:25,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1d635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:25, skipping insertion in model container [2025-01-09 05:01:25,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:23" (2/3) ... [2025-01-09 05:01:25,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1d635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:25, skipping insertion in model container [2025-01-09 05:01:25,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:25" (3/3) ... [2025-01-09 05:01:25,062 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2025-01-09 05:01:25,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:01:25,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-2.i that has 10 procedures, 218 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 05:01:25,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:01:25,120 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;@4acee42b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:01:25,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:01:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 132 states have (on average 1.5075757575757576) internal successors, (199), 135 states have internal predecessors, (199), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 05:01:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:01:25,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:25,163 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:25,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1297397943, now seen corresponding path program 1 times [2025-01-09 05:01:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:25,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067888346] [2025-01-09 05:01:25,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:25,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:01:25,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:01:25,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:25,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 05:01:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067888346] [2025-01-09 05:01:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067888346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717186633] [2025-01-09 05:01:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:25,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:25,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:25,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:01:25,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:01:25,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:01:25,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:25,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:25,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 05:01:25,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 05:01:25,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:01:25,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717186633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:25,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:01:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 05:01:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747423882] [2025-01-09 05:01:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:25,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:01:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:25,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:01:25,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:01:25,860 INFO L87 Difference]: Start difference. First operand has 218 states, 132 states have (on average 1.5075757575757576) internal successors, (199), 135 states have internal predecessors, (199), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 05:01:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:25,903 INFO L93 Difference]: Finished difference Result 432 states and 761 transitions. [2025-01-09 05:01:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:01:25,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-01-09 05:01:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:25,912 INFO L225 Difference]: With dead ends: 432 [2025-01-09 05:01:25,913 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 05:01:25,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:01:25,921 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:25,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 05:01:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-01-09 05:01:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 129 states have (on average 1.496124031007752) internal successors, (193), 131 states have internal predecessors, (193), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 05:01:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 343 transitions. [2025-01-09 05:01:25,967 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 343 transitions. Word has length 94 [2025-01-09 05:01:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:25,968 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 343 transitions. [2025-01-09 05:01:25,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 05:01:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 343 transitions. [2025-01-09 05:01:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 05:01:25,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:25,973 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:25,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:01:26,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 05:01:26,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:26,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash 682916507, now seen corresponding path program 1 times [2025-01-09 05:01:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:26,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706561238] [2025-01-09 05:01:26,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:26,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 05:01:26,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 05:01:26,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:26,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 05:01:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706561238] [2025-01-09 05:01:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706561238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:26,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:26,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294377513] [2025-01-09 05:01:26,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:26,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:26,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:26,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:26,772 INFO L87 Difference]: Start difference. First operand 214 states and 343 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:26,832 INFO L93 Difference]: Finished difference Result 424 states and 689 transitions. [2025-01-09 05:01:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-01-09 05:01:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:26,838 INFO L225 Difference]: With dead ends: 424 [2025-01-09 05:01:26,838 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 05:01:26,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:26,839 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 302 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:26,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1067 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 05:01:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2025-01-09 05:01:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 235 states have (on average 1.5319148936170213) internal successors, (360), 239 states have internal predecessors, (360), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2025-01-09 05:01:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 638 transitions. [2025-01-09 05:01:26,886 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 638 transitions. Word has length 94 [2025-01-09 05:01:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:26,886 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 638 transitions. [2025-01-09 05:01:26,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 638 transitions. [2025-01-09 05:01:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 05:01:26,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:26,890 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:26,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:01:26,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:26,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1584432628, now seen corresponding path program 1 times [2025-01-09 05:01:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637998327] [2025-01-09 05:01:26,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 05:01:26,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 05:01:26,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:26,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-01-09 05:01:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637998327] [2025-01-09 05:01:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637998327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925115235] [2025-01-09 05:01:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:27,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:27,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:27,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:27,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:27,503 INFO L87 Difference]: Start difference. First operand 389 states and 638 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:29,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:33,129 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 [] [2025-01-09 05:01:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:33,478 INFO L93 Difference]: Finished difference Result 824 states and 1351 transitions. [2025-01-09 05:01:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2025-01-09 05:01:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:33,487 INFO L225 Difference]: With dead ends: 824 [2025-01-09 05:01:33,488 INFO L226 Difference]: Without dead ends: 786 [2025-01-09 05:01:33,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:33,491 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 405 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:33,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1416 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 105 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 05:01:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-01-09 05:01:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 779. [2025-01-09 05:01:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 470 states have (on average 1.5297872340425531) internal successors, (719), 481 states have internal predecessors, (719), 269 states have call successors, (269), 36 states have call predecessors, (269), 39 states have return successors, (301), 269 states have call predecessors, (301), 269 states have call successors, (301) [2025-01-09 05:01:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1289 transitions. [2025-01-09 05:01:33,588 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1289 transitions. Word has length 173 [2025-01-09 05:01:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:33,590 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1289 transitions. [2025-01-09 05:01:33,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1289 transitions. [2025-01-09 05:01:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 05:01:33,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:33,599 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:33,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:01:33,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash 337355358, now seen corresponding path program 1 times [2025-01-09 05:01:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516138792] [2025-01-09 05:01:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:33,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 05:01:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 05:01:33,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-01-09 05:01:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516138792] [2025-01-09 05:01:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516138792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:34,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934436703] [2025-01-09 05:01:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:34,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:34,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:34,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:34,096 INFO L87 Difference]: Start difference. First operand 779 states and 1289 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:38,418 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 [] [2025-01-09 05:01:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:38,702 INFO L93 Difference]: Finished difference Result 1541 states and 2533 transitions. [2025-01-09 05:01:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:38,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2025-01-09 05:01:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:38,711 INFO L225 Difference]: With dead ends: 1541 [2025-01-09 05:01:38,712 INFO L226 Difference]: Without dead ends: 766 [2025-01-09 05:01:38,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:38,717 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 407 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:38,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1419 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 05:01:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-09 05:01:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 762. [2025-01-09 05:01:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 461 states have (on average 1.5227765726681128) internal successors, (702), 472 states have internal predecessors, (702), 261 states have call successors, (261), 35 states have call predecessors, (261), 39 states have return successors, (287), 262 states have call predecessors, (287), 261 states have call successors, (287) [2025-01-09 05:01:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1250 transitions. [2025-01-09 05:01:38,766 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1250 transitions. Word has length 173 [2025-01-09 05:01:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:38,768 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1250 transitions. [2025-01-09 05:01:38,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1250 transitions. [2025-01-09 05:01:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 05:01:38,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:38,773 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:38,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:01:38,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:38,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 985484040, now seen corresponding path program 1 times [2025-01-09 05:01:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853052321] [2025-01-09 05:01:38,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 05:01:38,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 05:01:38,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-01-09 05:01:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853052321] [2025-01-09 05:01:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853052321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462676846] [2025-01-09 05:01:39,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:39,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:39,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:39,219 INFO L87 Difference]: Start difference. First operand 762 states and 1250 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:39,655 INFO L93 Difference]: Finished difference Result 1219 states and 1962 transitions. [2025-01-09 05:01:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:01:39,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2025-01-09 05:01:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:39,662 INFO L225 Difference]: With dead ends: 1219 [2025-01-09 05:01:39,663 INFO L226 Difference]: Without dead ends: 678 [2025-01-09 05:01:39,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:39,666 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 392 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:39,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1388 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:01:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-01-09 05:01:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 668. [2025-01-09 05:01:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 408 states have (on average 1.4926470588235294) internal successors, (609), 417 states have internal predecessors, (609), 220 states have call successors, (220), 35 states have call predecessors, (220), 39 states have return successors, (244), 221 states have call predecessors, (244), 220 states have call successors, (244) [2025-01-09 05:01:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1073 transitions. [2025-01-09 05:01:39,706 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1073 transitions. Word has length 173 [2025-01-09 05:01:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:39,707 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1073 transitions. [2025-01-09 05:01:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1073 transitions. [2025-01-09 05:01:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:01:39,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:39,712 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:39,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:01:39,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:39,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2047666228, now seen corresponding path program 1 times [2025-01-09 05:01:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472927379] [2025-01-09 05:01:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:39,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:01:39,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:01:39,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:39,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-01-09 05:01:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:40,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472927379] [2025-01-09 05:01:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472927379] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:40,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494803791] [2025-01-09 05:01:40,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:40,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:40,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:40,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:01:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:01:40,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:01:40,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:40,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:40,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:01:40,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-01-09 05:01:40,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-01-09 05:01:40,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494803791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:40,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:40,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:01:40,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182740716] [2025-01-09 05:01:40,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:40,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:01:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:40,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:01:40,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:01:40,910 INFO L87 Difference]: Start difference. First operand 668 states and 1073 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-01-09 05:01:44,923 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 [] [2025-01-09 05:01:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:46,919 INFO L93 Difference]: Finished difference Result 1724 states and 2775 transitions. [2025-01-09 05:01:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:01:46,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 177 [2025-01-09 05:01:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:46,927 INFO L225 Difference]: With dead ends: 1724 [2025-01-09 05:01:46,927 INFO L226 Difference]: Without dead ends: 1060 [2025-01-09 05:01:46,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:01:46,933 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1091 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 703 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:46,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1678 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 1671 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 05:01:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-01-09 05:01:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1039. [2025-01-09 05:01:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 632 states have (on average 1.485759493670886) internal successors, (939), 647 states have internal predecessors, (939), 345 states have call successors, (345), 57 states have call predecessors, (345), 61 states have return successors, (383), 344 states have call predecessors, (383), 345 states have call successors, (383) [2025-01-09 05:01:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1667 transitions. [2025-01-09 05:01:47,018 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1667 transitions. Word has length 177 [2025-01-09 05:01:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:47,019 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1667 transitions. [2025-01-09 05:01:47,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-01-09 05:01:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1667 transitions. [2025-01-09 05:01:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:01:47,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:47,025 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:47,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:01:47,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:47,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1111685612, now seen corresponding path program 1 times [2025-01-09 05:01:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:47,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190956431] [2025-01-09 05:01:47,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:01:47,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:01:47,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:47,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-01-09 05:01:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190956431] [2025-01-09 05:01:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190956431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532548022] [2025-01-09 05:01:48,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:48,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:48,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:48,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:48,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:01:48,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:01:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:01:48,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:48,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 05:01:48,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:49,036 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 13 treesize of output 9 [2025-01-09 05:01:52,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:01:52,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:01:52,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-01-09 05:01:53,957 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-01-09 05:01:53,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-01-09 05:02:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-01-09 05:02:13,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:14,231 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 25 treesize of output 23 [2025-01-09 05:02:14,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-09 05:02:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532548022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:19,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:02:19,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2025-01-09 05:02:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838824942] [2025-01-09 05:02:19,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:19,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 05:02:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:19,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 05:02:19,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1121, Unknown=4, NotChecked=0, Total=1260 [2025-01-09 05:02:19,135 INFO L87 Difference]: Start difference. First operand 1039 states and 1667 transitions. Second operand has 31 states, 29 states have (on average 3.6551724137931036) internal successors, (106), 29 states have internal predecessors, (106), 16 states have call successors, (50), 10 states have call predecessors, (50), 12 states have return successors, (50), 14 states have call predecessors, (50), 16 states have call successors, (50) [2025-01-09 05:02:23,222 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 [] [2025-01-09 05:02:25,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:29,726 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 [] [2025-01-09 05:02:33,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:38,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 05:02:43,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 05:02:47,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:51,168 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 [] [2025-01-09 05:02:54,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:58,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []