./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_queue-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_queue-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', '8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5'] 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_queue-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 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:41:42,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:41:42,805 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:42,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:41:42,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:41:42,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:41:42,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:41:42,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:41:42,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:41:42,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:41:42,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:41:42,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:41:42,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:41:42,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:41:42,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:41:42,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:41:42,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:41:42,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:41:42,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:41:42,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:41:42,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:41:42,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:41:42,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:41:42,856 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 -> 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 [2024-11-07 00:41:43,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:41:43,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:41:43,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:41:43,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:41:43,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:41:43,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_queue-2.i [2024-11-07 00:41:44,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:41:44,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:41:44,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_queue-2.i [2024-11-07 00:41:44,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/990778b03/a1b023c0b2e54fd6ab901e44f77a8303/FLAGd1d8830ee [2024-11-07 00:41:45,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/990778b03/a1b023c0b2e54fd6ab901e44f77a8303 [2024-11-07 00:41:45,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:41:45,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:41:45,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:41:45,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:41:45,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:41:45,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:45,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd9e017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45, skipping insertion in model container [2024-11-07 00:41:45,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:45,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:41:45,534 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_queue-2.i[34556,34569] [2024-11-07 00:41:45,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:41:45,722 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:41:45,778 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_queue-2.i[34556,34569] [2024-11-07 00:41:45,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:41:45,952 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:41:45,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45 WrapperNode [2024-11-07 00:41:45,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:41:45,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:41:45,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:41:45,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:41:45,959 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:41:45" (1/1) ... [2024-11-07 00:41:45,990 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:41:45" (1/1) ... [2024-11-07 00:41:46,046 INFO L138 Inliner]: procedures = 249, calls = 626, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1337 [2024-11-07 00:41:46,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:41:46,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:41:46,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:41:46,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:41:46,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,126 INFO L175 MemorySlicer]: Split 386 memory accesses to 20 slices as follows [2, 8, 8, 8, 20, 46, 12, 83, 8, 0, 8, 4, 2, 113, 6, 2, 8, 6, 40, 2]. 29 percent of accesses are in the largest equivalence class. The 115 initializations are split as follows [2, 3, 3, 3, 6, 0, 6, 40, 2, 0, 2, 0, 0, 46, 0, 0, 2, 0, 0, 0]. The 85 writes are split as follows [0, 2, 2, 2, 8, 0, 3, 22, 4, 0, 4, 2, 0, 33, 0, 0, 3, 0, 0, 0]. [2024-11-07 00:41:46,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:41:46,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:41:46,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:41:46,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:41:46,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (1/1) ... [2024-11-07 00:41:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:41:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:41:46,288 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:41:46,293 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:41:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 00:41:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 00:41:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 00:41:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2024-11-07 00:41:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2024-11-07 00:41:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-07 00:41:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-07 00:41:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 00:41:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 00:41:46,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-07 00:41:46,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-07 00:41:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-07 00:41:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-07 00:41:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-07 00:41:46,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 00:41:46,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure enqueue [2024-11-07 00:41:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure enqueue [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-07 00:41:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 00:41:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 00:41:46,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:41:46,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 00:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 00:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 00:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 00:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-07 00:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-07 00:41:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-07 00:41:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-07 00:41:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-07 00:41:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 00:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-07 00:41:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:41:46,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:41:46,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:41:46,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:41:46,861 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: 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:41:46,861 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:41:46,861 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: 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:41:46,862 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);#res := 0; [2024-11-07 00:41:47,570 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097: SUMMARY for call __CS_cs(); srcloc: null [2024-11-07 00:41:47,570 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-11-07 00:41:47,570 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-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:41:47,570 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132: SUMMARY for call __CS_cs(); srcloc: null [2024-11-07 00:41:47,571 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2024-11-07 00:41:47,571 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-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:41:47,571 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075: SUMMARY for call __CS_cs(); srcloc: null [2024-11-07 00:41:47,571 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-11-07 00:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-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:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: 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:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-11-07 00:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: 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:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-11-07 00:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: 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:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##78: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2024-11-07 00:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: 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:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##128: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-11-07 00:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: 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:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2024-11-07 00:41:47,572 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: 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:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2024-11-07 00:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##166: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-11-07 00:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: 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:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##168: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-11-07 00:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##167: 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:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-11-07 00:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-07 00:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: 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:41:47,573 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##117: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-11-07 00:41:47,628 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: 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:41:47,628 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: 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:41:52,416 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-07 00:41:52,417 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:41:52,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:41:52,442 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 00:41:52,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:52 BoogieIcfgContainer [2024-11-07 00:41:52,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:41:52,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:41:52,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:41:52,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:41:52,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:45" (1/3) ... [2024-11-07 00:41:52,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93e074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:52, skipping insertion in model container [2024-11-07 00:41:52,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:45" (2/3) ... [2024-11-07 00:41:52,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93e074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:52, skipping insertion in model container [2024-11-07 00:41:52,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:52" (3/3) ... [2024-11-07 00:41:52,451 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_queue-2.i [2024-11-07 00:41:52,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:41:52,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:41:52,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:41:52,550 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;@4dfcbf98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:41:52,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:41:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 204 states have (on average 1.4705882352941178) internal successors, (300), 206 states have internal predecessors, (300), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-07 00:41:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-07 00:41:52,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:41:52,602 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:52,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:41:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:41:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1377607217, now seen corresponding path program 1 times [2024-11-07 00:41:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:41:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971474129] [2024-11-07 00:41:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:41:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:41:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 00:41:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:41:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:41:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:41:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:41:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 00:41:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:41:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 00:41:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:41:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:41:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:41:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:41:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:41:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:41:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 00:41:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 00:41:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 00:41:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 00:41:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:41:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 00:41:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:41:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 00:41:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 00:41:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 00:41:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 00:41:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 00:41:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:41:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 00:41:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 00:41:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 00:41:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 00:41:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 00:41:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 00:41:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-07 00:41:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:41:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-07 00:41:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-07 00:41:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:41:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 00:41:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 00:41:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 00:41:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 00:41:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:41:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 00:41:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-07 00:41:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:41:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-07 00:41:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-07 00:41:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-11-07 00:41:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-07 00:41:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-07 00:41:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-07 00:41:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-07 00:41:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:41:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971474129] [2024-11-07 00:41:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971474129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:41:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:41:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:41:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373947464] [2024-11-07 00:41:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:41:54,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:41:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:41:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:41:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:41:54,362 INFO L87 Difference]: Start difference. First operand has 351 states, 204 states have (on average 1.4705882352941178) internal successors, (300), 206 states have internal predecessors, (300), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-07 00:41:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:41:54,446 INFO L93 Difference]: Finished difference Result 695 states and 1260 transitions. [2024-11-07 00:41:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:41:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 322 [2024-11-07 00:41:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:41:54,462 INFO L225 Difference]: With dead ends: 695 [2024-11-07 00:41:54,462 INFO L226 Difference]: Without dead ends: 344 [2024-11-07 00:41:54,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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:41:54,474 INFO L432 NwaCegarLoop]: 562 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, 562 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:41:54,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:41:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-07 00:41:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-07 00:41:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 199 states have (on average 1.4472361809045227) internal successors, (288), 200 states have internal predecessors, (288), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-07 00:41:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 558 transitions. [2024-11-07 00:41:54,591 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 558 transitions. Word has length 322 [2024-11-07 00:41:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:41:54,593 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 558 transitions. [2024-11-07 00:41:54,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-07 00:41:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 558 transitions. [2024-11-07 00:41:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-07 00:41:54,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:41:54,605 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:41:54,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:41:54,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:41:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2089945241, now seen corresponding path program 1 times [2024-11-07 00:41:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:41:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748700871] [2024-11-07 00:41:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:41:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:41:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 00:41:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:41:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:41:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:41:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:41:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 00:41:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:41:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 00:41:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 00:41:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 00:41:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 00:41:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 00:41:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 00:41:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:41:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 00:41:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 00:41:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 00:41:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 00:41:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:41:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 00:41:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:41:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 00:41:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 00:41:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 00:41:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 00:41:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 00:41:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:41:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 00:41:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 00:41:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 00:41:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 00:41:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 00:41:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 00:41:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-07 00:41:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:41:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-07 00:41:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-07 00:41:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:41:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 00:41:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 00:41:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 00:41:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 00:41:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:41:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 00:41:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-07 00:41:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:41:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-07 00:41:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-07 00:41:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-11-07 00:41:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-07 00:41:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-07 00:41:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-07 00:41:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-07 00:41:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:41:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748700871] [2024-11-07 00:41:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748700871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:41:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:41:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:41:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841657895] [2024-11-07 00:41:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:41:56,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:41:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:41:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:41:56,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:41:56,683 INFO L87 Difference]: Start difference. First operand 344 states and 558 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-07 00:41:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:41:56,864 INFO L93 Difference]: Finished difference Result 684 states and 1118 transitions. [2024-11-07 00:41:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:41:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 322 [2024-11-07 00:41:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:41:56,881 INFO L225 Difference]: With dead ends: 684 [2024-11-07 00:41:56,881 INFO L226 Difference]: Without dead ends: 574 [2024-11-07 00:41:56,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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:41:56,884 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 440 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:41:56,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1741 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:41:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-07 00:41:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-11-07 00:41:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 336 states have (on average 1.5208333333333333) internal successors, (511), 338 states have internal predecessors, (511), 217 states have call successors, (217), 18 states have call predecessors, (217), 18 states have return successors, (224), 217 states have call predecessors, (224), 217 states have call successors, (224) [2024-11-07 00:41:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 952 transitions. [2024-11-07 00:41:56,973 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 952 transitions. Word has length 322 [2024-11-07 00:41:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:41:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 952 transitions. [2024-11-07 00:41:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-07 00:41:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 952 transitions. [2024-11-07 00:41:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-07 00:41:56,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:41:56,991 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:41:56,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:41:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:41:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1558500961, now seen corresponding path program 1 times [2024-11-07 00:41:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:41:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934288564] [2024-11-07 00:41:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:41:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:41:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 00:41:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:41:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:41:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:41:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:41:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:41:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 00:41:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:41:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 00:41:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:41:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:41:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 00:41:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:41:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 00:41:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 00:41:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 00:41:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 00:41:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 00:41:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:41:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 00:41:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 00:41:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 00:41:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 00:41:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-07 00:41:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 00:41:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 00:41:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:41:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 00:41:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 00:41:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 00:41:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 00:41:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 00:41:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 00:41:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-07 00:41:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 00:41:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-07 00:41:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-07 00:41:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-07 00:41:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 00:41:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 00:41:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 00:41:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 00:41:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 00:41:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 00:41:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-07 00:41:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-07 00:41:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-07 00:41:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-11-07 00:41:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-11-07 00:41:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-07 00:41:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-07 00:41:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-07 00:41:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-07 00:41:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-07 00:41:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-07 00:41:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-07 00:41:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-07 00:41:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-11-07 00:41:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-11-07 00:41:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-07 00:41:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-11-07 00:41:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-07 00:41:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-11-07 00:41:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-07 00:41:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-07 00:41:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:41:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2024-11-07 00:41:58,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:41:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934288564] [2024-11-07 00:41:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934288564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:41:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:41:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:41:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93625174] [2024-11-07 00:41:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:41:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:41:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:41:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:41:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:41:58,635 INFO L87 Difference]: Start difference. First operand 572 states and 952 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 5 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2024-11-07 00:42:02,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:06,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:10,736 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:14,749 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,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:18,035 INFO L93 Difference]: Finished difference Result 1146 states and 1914 transitions. [2024-11-07 00:42:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:42:18,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 5 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) Word has length 400 [2024-11-07 00:42:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:18,042 INFO L225 Difference]: With dead ends: 1146 [2024-11-07 00:42:18,042 INFO L226 Difference]: Without dead ends: 578 [2024-11-07 00:42:18,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:42:18,047 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 76 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 409 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:18,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1918 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 19.2s Time] [2024-11-07 00:42:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-07 00:42:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 572. [2024-11-07 00:42:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 336 states have (on average 1.5089285714285714) internal successors, (507), 340 states have internal predecessors, (507), 215 states have call successors, (215), 18 states have call predecessors, (215), 20 states have return successors, (227), 215 states have call predecessors, (227), 215 states have call successors, (227) [2024-11-07 00:42:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 949 transitions. [2024-11-07 00:42:18,135 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 949 transitions. Word has length 400 [2024-11-07 00:42:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:18,136 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 949 transitions. [2024-11-07 00:42:18,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 5 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2024-11-07 00:42:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 949 transitions. [2024-11-07 00:42:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-07 00:42:18,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:18,148 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:42:18,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:18,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1896105068, now seen corresponding path program 1 times [2024-11-07 00:42:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126127960] [2024-11-07 00:42:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:19,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 00:42:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:42:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:42:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:42:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:42:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 00:42:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:42:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:42:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 00:42:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 00:42:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:42:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 00:42:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 00:42:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:42:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:42:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 00:42:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:42:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:42:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:42:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 00:42:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 00:42:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 00:42:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 00:42:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 00:42:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 00:42:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 00:42:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-07 00:42:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:42:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-07 00:42:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 00:42:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-07 00:42:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:42:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 00:42:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-07 00:42:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:42:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-07 00:42:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 00:42:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:42:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-07 00:42:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-07 00:42:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 00:42:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-07 00:42:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-11-07 00:42:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-07 00:42:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-07 00:42:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-11-07 00:42:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-07 00:42:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-07 00:42:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2024-11-07 00:42:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-07 00:42:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-07 00:42:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-07 00:42:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-07 00:42:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-07 00:42:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-07 00:42:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-11-07 00:42:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-07 00:42:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-07 00:42:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-11-07 00:42:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2024-11-07 00:42:20,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126127960] [2024-11-07 00:42:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126127960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:20,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:20,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:42:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678268631] [2024-11-07 00:42:20,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:20,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:42:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:42:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:42:20,293 INFO L87 Difference]: Start difference. First operand 572 states and 949 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 5 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2024-11-07 00:42:24,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:28,374 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:32,385 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:36,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:40,414 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:44,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:42:48,445 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:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:42:57,788 INFO L93 Difference]: Finished difference Result 1278 states and 2109 transitions. [2024-11-07 00:42:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:42:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 5 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) Word has length 401 [2024-11-07 00:42:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:42:57,808 INFO L225 Difference]: With dead ends: 1278 [2024-11-07 00:42:57,808 INFO L226 Difference]: Without dead ends: 1164 [2024-11-07 00:42:57,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:42:57,813 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 650 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 341 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:42:57,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 2150 Invalid, 2126 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [341 Valid, 1778 Invalid, 7 Unknown, 0 Unchecked, 35.6s Time] [2024-11-07 00:42:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2024-11-07 00:42:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1145. [2024-11-07 00:42:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 672 states have (on average 1.5074404761904763) internal successors, (1013), 683 states have internal predecessors, (1013), 429 states have call successors, (429), 36 states have call predecessors, (429), 43 states have return successors, (469), 429 states have call predecessors, (469), 429 states have call successors, (469) [2024-11-07 00:42:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1911 transitions. [2024-11-07 00:42:57,972 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1911 transitions. Word has length 401 [2024-11-07 00:42:57,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:42:57,972 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1911 transitions. [2024-11-07 00:42:57,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 5 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2024-11-07 00:42:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1911 transitions. [2024-11-07 00:42:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-07 00:42:57,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:42:57,991 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:42:57,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:42:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:42:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1724169538, now seen corresponding path program 1 times [2024-11-07 00:42:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:42:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292085867] [2024-11-07 00:42:57,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:42:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:42:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 00:42:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:42:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:42:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 00:42:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 00:42:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 00:42:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 00:42:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 00:42:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 00:42:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:42:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 00:42:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 00:42:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 00:42:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 00:42:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 00:42:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:42:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 00:42:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 00:42:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 00:42:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 00:42:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:42:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 00:42:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 00:42:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 00:42:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 00:42:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 00:42:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 00:42:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 00:42:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-07 00:42:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 00:42:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-07 00:42:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 00:42:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-07 00:42:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 00:42:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 00:42:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-07 00:42:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 00:42:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-07 00:42:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 00:42:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 00:42:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-07 00:42:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-07 00:42:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 00:42:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-07 00:42:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-11-07 00:42:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-07 00:42:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-07 00:42:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-11-07 00:42:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-11-07 00:42:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-07 00:42:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2024-11-07 00:42:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-07 00:42:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-07 00:42:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2024-11-07 00:42:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-07 00:42:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-07 00:42:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-07 00:42:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-11-07 00:42:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-07 00:42:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-07 00:42:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-11-07 00:42:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:42:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2024-11-07 00:42:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:42:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292085867] [2024-11-07 00:42:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292085867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:42:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:42:59,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:42:59,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391447857] [2024-11-07 00:42:59,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:42:59,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:42:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:42:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:42:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:42:59,875 INFO L87 Difference]: Start difference. First operand 1145 states and 1911 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (61), 5 states have call predecessors, (61), 2 states have return successors, (61), 3 states have call predecessors, (61), 4 states have call successors, (61) [2024-11-07 00:43:03,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 00:43:07,964 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:43:11,971 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 []