./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506'] 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-?-4f9af40 [2024-11-07 00:41:59,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:41:59,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:41:59,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:41:59,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:41:59,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:41:59,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:41:59,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:41:59,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:41:59,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:41:59,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:41:59,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:41:59,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:41:59,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:41:59,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:41:59,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:41:59,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:41:59,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:41:59,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:41:59,261 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 [2024-11-07 00:41:59,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:41:59,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:41:59,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:41:59,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:41:59,556 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:41:59,557 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 [2024-11-07 00:42:00,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:42:01,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:42:01,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2024-11-07 00:42:01,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084ee560e/3e2794c2c6eb4232863cd15c2f3ed996/FLAG468a07e04 [2024-11-07 00:42:01,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084ee560e/3e2794c2c6eb4232863cd15c2f3ed996 [2024-11-07 00:42:01,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:42:01,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:42:01,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:42:01,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:42:01,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:42:01,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:01" (1/1) ... [2024-11-07 00:42:01,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694ba27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:01, skipping insertion in model container [2024-11-07 00:42:01,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:01" (1/1) ... [2024-11-07 00:42:01,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:42:01,716 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] [2024-11-07 00:42:01,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:42:01,867 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:42:01,912 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] [2024-11-07 00:42:01,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:42:02,029 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:42:02,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02 WrapperNode [2024-11-07 00:42:02,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:42:02,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:42:02,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:42:02,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:42:02,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,127 INFO L138 Inliner]: procedures = 252, calls = 297, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 650 [2024-11-07 00:42:02,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:42:02,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:42:02,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:42:02,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:42:02,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,207 INFO L175 MemorySlicer]: Split 148 memory accesses to 18 slices as follows [2, 8, 8, 2, 4, 8, 22, 20, 12, 10, 6, 4, 20, 0, 2, 6, 6, 8]. 15 percent of accesses are in the largest equivalence class. The 51 initializations are split as follows [2, 3, 3, 0, 0, 3, 10, 6, 6, 2, 2, 2, 10, 0, 0, 0, 0, 2]. The 33 writes are split as follows [0, 2, 2, 0, 2, 2, 6, 8, 3, 3, 2, 0, 0, 0, 0, 0, 0, 3]. [2024-11-07 00:42:02,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:42:02,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:42:02,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:42:02,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:42:02,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (1/1) ... [2024-11-07 00:42:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:42:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:42:02,335 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) [2024-11-07 00:42:02,341 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 [2024-11-07 00:42:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 00:42:02,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 00:42:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 00:42:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-07 00:42:02,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-07 00:42:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 00:42:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 00:42:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 00:42:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-07 00:42:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-07 00:42:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-07 00:42:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-07 00:42:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-07 00:42:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-07 00:42:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-11-07 00:42:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 00:42:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 00:42:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 00:42:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 00:42:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 00:42:02,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-07 00:42:02,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-07 00:42:02,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 00:42:02,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 00:42:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2024-11-07 00:42:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-07 00:42:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-07 00:42:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-07 00:42:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-07 00:42:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 00:42:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-07 00:42:02,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-07 00:42:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:42:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 00:42:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-07 00:42:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-07 00:42:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-07 00:42:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-07 00:42:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-07 00:42:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:42:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:42:02,638 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:42:02,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:42:02,672 INFO L735 $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)); [2024-11-07 00:42:02,673 INFO L735 $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; [2024-11-07 00:42:03,189 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-07 00:42:03,191 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: 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; [2024-11-07 00:42:03,191 INFO L735 $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)); [2024-11-07 00:42:03,191 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: 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; [2024-11-07 00:42:03,191 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-07 00:42:03,191 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: 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; [2024-11-07 00:42:03,191 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-07 00:42:03,192 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: 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; [2024-11-07 00:42:03,192 INFO L735 $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; [2024-11-07 00:42:03,192 INFO L735 $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; [2024-11-07 00:42:03,192 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2024-11-07 00:42:03,192 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: 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; [2024-11-07 00:42:03,192 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-07 00:42:03,211 INFO L735 $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); [2024-11-07 00:42:03,211 INFO L735 $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)); [2024-11-07 00:42:03,212 INFO L735 $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)); [2024-11-07 00:42:03,212 INFO L735 $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); [2024-11-07 00:42:03,212 INFO L735 $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); [2024-11-07 00:42:03,212 INFO L735 $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)); [2024-11-07 00:42:03,212 INFO L735 $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)); [2024-11-07 00:42:03,212 INFO L735 $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); [2024-11-07 00:42:03,212 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2024-11-07 00:42:07,518 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-11-07 00:42:07,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:42:07,535 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:42:07,535 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 00:42:07,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:07 BoogieIcfgContainer [2024-11-07 00:42:07,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:42:07,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:42:07,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:42:07,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:42:07,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:01" (1/3) ... [2024-11-07 00:42:07,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b46880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:07, skipping insertion in model container [2024-11-07 00:42:07,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:02" (2/3) ... [2024-11-07 00:42:07,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b46880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:07, skipping insertion in model container [2024-11-07 00:42:07,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:07" (3/3) ... [2024-11-07 00:42:07,544 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2024-11-07 00:42:07,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:42:07,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:42:07,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:42:07,640 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;@3e645ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:42:07,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:42:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 137 states have internal predecessors, (203), 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) [2024-11-07 00:42:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:42:07,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:07,669 INFO L215 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] [2024-11-07 00:42:07,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:07,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash 977295411, now seen corresponding path program 1 times [2024-11-07 00:42:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917656636] [2024-11-07 00:42:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 00:42:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:42:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:42:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:42:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:42:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 00:42:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:42:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 00:42:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:42:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:42:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:42:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:42:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:42:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:42:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 00:42:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917656636] [2024-11-07 00:42:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917656636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:42:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129144695] [2024-11-07 00:42:08,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:08,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:42:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:08,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:42:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:42:08,362 INFO L87 Difference]: Start difference. First operand has 220 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 137 states have internal predecessors, (203), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:42:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:08,410 INFO L93 Difference]: Finished difference Result 436 states and 769 transitions. [2024-11-07 00:42:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:42:08,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 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 [2024-11-07 00:42:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:08,424 INFO L225 Difference]: With dead ends: 436 [2024-11-07 00:42:08,424 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 00:42:08,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:42:08,432 INFO L432 NwaCegarLoop]: 349 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, 349 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:08,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:42:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 00:42:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-07 00:42:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 133 states have internal predecessors, (195), 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) [2024-11-07 00:42:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 345 transitions. [2024-11-07 00:42:08,500 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 345 transitions. Word has length 94 [2024-11-07 00:42:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:08,500 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 345 transitions. [2024-11-07 00:42:08,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 00:42:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2024-11-07 00:42:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:42:08,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:08,511 INFO L215 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] [2024-11-07 00:42:08,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:42:08,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:08,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 362813975, now seen corresponding path program 1 times [2024-11-07 00:42:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941374658] [2024-11-07 00:42:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 00:42:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:42:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:42:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:42:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:42:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 00:42:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:42:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 00:42:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:42:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:42:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:42:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:42:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:42:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:42:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 00:42:09,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941374658] [2024-11-07 00:42:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941374658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:09,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:09,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:42:09,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132996696] [2024-11-07 00:42:09,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:09,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:42:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:42:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:42:09,364 INFO L87 Difference]: Start difference. First operand 216 states and 345 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) [2024-11-07 00:42:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:09,465 INFO L93 Difference]: Finished difference Result 428 states and 693 transitions. [2024-11-07 00:42:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:42:09,465 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 [2024-11-07 00:42:09,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:09,476 INFO L225 Difference]: With dead ends: 428 [2024-11-07 00:42:09,478 INFO L226 Difference]: Without dead ends: 394 [2024-11-07 00:42:09,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:42:09,480 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 304 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:09,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1075 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:42:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-07 00:42:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2024-11-07 00:42:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 239 states have (on average 1.5230125523012552) internal successors, (364), 243 states have internal predecessors, (364), 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) [2024-11-07 00:42:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 642 transitions. [2024-11-07 00:42:09,557 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 642 transitions. Word has length 94 [2024-11-07 00:42:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 642 transitions. [2024-11-07 00:42:09,557 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) [2024-11-07 00:42:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 642 transitions. [2024-11-07 00:42:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 00:42:09,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:09,566 INFO L215 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] [2024-11-07 00:42:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:42:09,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:09,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash 641085175, now seen corresponding path program 1 times [2024-11-07 00:42:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321253578] [2024-11-07 00:42:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 00:42:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:42:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:42:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:42:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:42:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 00:42:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:42:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:42:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 00:42:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 00:42:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:42:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 00:42:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 00:42:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:42:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:42:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 00:42:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:42:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:42:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:42:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 00:42:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 00:42:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-07 00:42:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:10,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321253578] [2024-11-07 00:42:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321253578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:42:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289544489] [2024-11-07 00:42:10,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:10,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:42:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:42:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:42:10,871 INFO L87 Difference]: Start difference. First operand 393 states and 642 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 00:42:14,888 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 [] [2024-11-07 00:42:18,953 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 [] [2024-11-07 00:42:23,038 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 [] [2024-11-07 00:42:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:25,166 INFO L93 Difference]: Finished difference Result 852 states and 1389 transitions. [2024-11-07 00:42:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:42:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 5 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 [2024-11-07 00:42:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:25,175 INFO L225 Difference]: With dead ends: 852 [2024-11-07 00:42:25,175 INFO L226 Difference]: Without dead ends: 814 [2024-11-07 00:42:25,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:42:25,177 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 509 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 438 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:25,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1386 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 812 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2024-11-07 00:42:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-11-07 00:42:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 795. [2024-11-07 00:42:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 482 states have (on average 1.516597510373444) internal successors, (731), 497 states have internal predecessors, (731), 269 states have call successors, (269), 36 states have call predecessors, (269), 43 states have return successors, (309), 269 states have call predecessors, (309), 269 states have call successors, (309) [2024-11-07 00:42:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1309 transitions. [2024-11-07 00:42:25,277 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1309 transitions. Word has length 173 [2024-11-07 00:42:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:25,278 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1309 transitions. [2024-11-07 00:42:25,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 00:42:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1309 transitions. [2024-11-07 00:42:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 00:42:25,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:25,286 INFO L215 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] [2024-11-07 00:42:25,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:42:25,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:25,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash -237819248, now seen corresponding path program 1 times [2024-11-07 00:42:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846025620] [2024-11-07 00:42:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:42:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:42:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:42:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:42:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:42:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:42:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:42:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:42:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:42:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 00:42:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 00:42:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 00:42:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:42:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:42:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 00:42:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 00:42:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:42:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:42:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 00:42:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 00:42:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 00:42:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 00:42:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 00:42:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-11-07 00:42:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846025620] [2024-11-07 00:42:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846025620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:26,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:26,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:42:26,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302316126] [2024-11-07 00:42:26,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:26,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:42:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:42:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:42:26,238 INFO L87 Difference]: Start difference. First operand 795 states and 1309 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 00:42:27,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:33,368 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 [] [2024-11-07 00:42:34,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:37,930 INFO L93 Difference]: Finished difference Result 1601 states and 2613 transitions. [2024-11-07 00:42:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 00:42:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 177 [2024-11-07 00:42:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:37,939 INFO L225 Difference]: With dead ends: 1601 [2024-11-07 00:42:37,939 INFO L226 Difference]: Without dead ends: 809 [2024-11-07 00:42:37,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:42:37,944 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 665 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 498 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:37,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1180 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1160 Invalid, 1 Unknown, 0 Unchecked, 10.6s Time] [2024-11-07 00:42:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-07 00:42:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 780. [2024-11-07 00:42:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 475 states have (on average 1.5073684210526315) internal successors, (716), 490 states have internal predecessors, (716), 261 states have call successors, (261), 35 states have call predecessors, (261), 43 states have return successors, (294), 262 states have call predecessors, (294), 261 states have call successors, (294) [2024-11-07 00:42:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1271 transitions. [2024-11-07 00:42:38,074 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1271 transitions. Word has length 177 [2024-11-07 00:42:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:38,075 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1271 transitions. [2024-11-07 00:42:38,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 00:42:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1271 transitions. [2024-11-07 00:42:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 00:42:38,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:38,083 INFO L215 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] [2024-11-07 00:42:38,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:42:38,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:38,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1103441803, now seen corresponding path program 1 times [2024-11-07 00:42:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:38,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903686834] [2024-11-07 00:42:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:42:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:42:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:42:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:42:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 00:42:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:42:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:42:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 00:42:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 00:42:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:42:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 00:42:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 00:42:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:42:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:42:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 00:42:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:42:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:42:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:42:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 00:42:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 00:42:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-07 00:42:39,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:39,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903686834] [2024-11-07 00:42:39,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903686834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:39,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:39,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:42:39,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460456070] [2024-11-07 00:42:39,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:39,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:42:39,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:42:39,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:42:39,063 INFO L87 Difference]: Start difference. First operand 780 states and 1271 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 00:42:41,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:43,657 INFO L93 Difference]: Finished difference Result 1259 states and 2012 transitions. [2024-11-07 00:42:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:42:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 5 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 [2024-11-07 00:42:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:43,664 INFO L225 Difference]: With dead ends: 1259 [2024-11-07 00:42:43,665 INFO L226 Difference]: Without dead ends: 706 [2024-11-07 00:42:43,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:42:43,671 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 487 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:43,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1523 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-07 00:42:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-07 00:42:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 684. [2024-11-07 00:42:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 420 states have (on average 1.4785714285714286) internal successors, (621), 433 states have internal predecessors, (621), 220 states have call successors, (220), 35 states have call predecessors, (220), 43 states have return successors, (250), 221 states have call predecessors, (250), 220 states have call successors, (250) [2024-11-07 00:42:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1091 transitions. [2024-11-07 00:42:43,758 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1091 transitions. Word has length 173 [2024-11-07 00:42:43,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:43,758 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1091 transitions. [2024-11-07 00:42:43,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 00:42:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1091 transitions. [2024-11-07 00:42:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 00:42:43,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:43,766 INFO L215 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] [2024-11-07 00:42:43,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:42:43,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2021848762, now seen corresponding path program 1 times [2024-11-07 00:42:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690783786] [2024-11-07 00:42:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:42:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:42:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:42:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:42:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:42:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:42:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:42:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:42:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 00:42:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 00:42:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 00:42:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:42:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:42:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 00:42:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 00:42:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:42:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:42:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 00:42:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 00:42:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 00:42:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 00:42:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 00:42:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-07 00:42:44,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:44,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690783786] [2024-11-07 00:42:44,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690783786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:42:44,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219167720] [2024-11-07 00:42:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:44,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:42:44,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:42:44,776 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) [2024-11-07 00:42:44,777 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 [2024-11-07 00:42:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:45,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 00:42:45,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:42:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-07 00:42:45,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:42:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-07 00:42:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219167720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:42:45,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:42:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-07 00:42:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689968767] [2024-11-07 00:42:45,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:42:45,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 00:42:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 00:42:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:42:45,768 INFO L87 Difference]: Start difference. First operand 684 states and 1091 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 12 states have internal predecessors, (86), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-07 00:42:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:50,161 INFO L93 Difference]: Finished difference Result 1764 states and 2826 transitions. [2024-11-07 00:42:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:42:50,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 12 states have internal predecessors, (86), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 177 [2024-11-07 00:42:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:50,170 INFO L225 Difference]: With dead ends: 1764 [2024-11-07 00:42:50,170 INFO L226 Difference]: Without dead ends: 1084 [2024-11-07 00:42:50,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:42:50,174 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 866 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:50,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2118 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 00:42:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-07 00:42:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1052. [2024-11-07 00:42:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 642 states have (on average 1.4781931464174456) internal successors, (949), 660 states have internal predecessors, (949), 345 states have call successors, (345), 57 states have call predecessors, (345), 64 states have return successors, (389), 344 states have call predecessors, (389), 345 states have call successors, (389) [2024-11-07 00:42:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1683 transitions. [2024-11-07 00:42:50,286 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1683 transitions. Word has length 177 [2024-11-07 00:42:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:50,287 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1683 transitions. [2024-11-07 00:42:50,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 12 states have internal predecessors, (86), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-07 00:42:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1683 transitions. [2024-11-07 00:42:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 00:42:50,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:50,296 INFO L215 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] [2024-11-07 00:42:50,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:42:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:42:50,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 886233306, now seen corresponding path program 1 times [2024-11-07 00:42:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341588952] [2024-11-07 00:42:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:51,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 00:42:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:42:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 00:42:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:42:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:42:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:42:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:42:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:42:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 00:42:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 00:42:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 00:42:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 00:42:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:42:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 00:42:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 00:42:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:42:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:42:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 00:42:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 00:42:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 00:42:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 00:42:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 00:42:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-07 00:42:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341588952] [2024-11-07 00:42:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341588952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:42:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143424461] [2024-11-07 00:42:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:42:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:42:53,056 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) [2024-11-07 00:42:53,059 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 [2024-11-07 00:42:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:53,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 00:42:53,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:42:53,838 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 [2024-11-07 00:43:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 00:43:02,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 00:43:02,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2024-11-07 00:43:04,782 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-07 00:43:04,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-07 00:43:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-07 00:43:27,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:43:27,289 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 [2024-11-07 00:43:27,293 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 [2024-11-07 00:43:27,725 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 20 treesize of output 18 [2024-11-07 00:43:27,728 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 26 treesize of output 22 [2024-11-07 00:43:27,801 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 20 treesize of output 18 [2024-11-07 00:43:27,804 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 26 treesize of output 22 [2024-11-07 00:43:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2024-11-07 00:43:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143424461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:43:27,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:43:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 9] total 39 [2024-11-07 00:43:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779592624] [2024-11-07 00:43:27,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:43:27,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-07 00:43:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:43:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-07 00:43:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1336, Unknown=1, NotChecked=0, Total=1482 [2024-11-07 00:43:27,935 INFO L87 Difference]: Start difference. First operand 1052 states and 1683 transitions. Second operand has 39 states, 36 states have (on average 3.7777777777777777) internal successors, (136), 35 states have internal predecessors, (136), 18 states have call successors, (59), 13 states have call predecessors, (59), 14 states have return successors, (59), 16 states have call predecessors, (59), 18 states have call successors, (59)