./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', 'e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874'] 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/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 12:38:50,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 12:38:50,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 12:38:50,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 12:38:50,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 12:38:50,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 12:38:50,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 12:38:50,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 12:38:50,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 12:38:50,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 12:38:50,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 12:38:50,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 12:38:50,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 12:38:50,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 12:38:50,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 12:38:50,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 12:38:50,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 12:38:50,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 12:38:50,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 12:38:50,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 12:38:50,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 12:38:50,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 12:38:50,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 12:38:50,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 12:38:50,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 12:38:50,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 12:38:50,557 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 [2024-11-07 12:38:50,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 12:38:50,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 12:38:50,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 12:38:50,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 12:38:50,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 12:38:50,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-11-07 12:38:52,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 12:38:52,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 12:38:52,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-11-07 12:38:52,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f493962/e9a5fcf37673413dbd1e1423a6eafc85/FLAG468504a07 [2024-11-07 12:38:52,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43f493962/e9a5fcf37673413dbd1e1423a6eafc85 [2024-11-07 12:38:52,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 12:38:52,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 12:38:52,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 12:38:52,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 12:38:52,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 12:38:52,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:38:52" (1/1) ... [2024-11-07 12:38:52,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94c1161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:52, skipping insertion in model container [2024-11-07 12:38:52,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:38:52" (1/1) ... [2024-11-07 12:38:52,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 12:38:53,309 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/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2024-11-07 12:38:53,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 12:38:53,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 12:38:53,526 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/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2024-11-07 12:38:53,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 12:38:53,572 INFO L204 MainTranslator]: Completed translation [2024-11-07 12:38:53,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53 WrapperNode [2024-11-07 12:38:53,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 12:38:53,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 12:38:53,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 12:38:53,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 12:38:53,580 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:38:53" (1/1) ... [2024-11-07 12:38:53,615 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:38:53" (1/1) ... [2024-11-07 12:38:53,708 INFO L138 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1156 [2024-11-07 12:38:53,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 12:38:53,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 12:38:53,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 12:38:53,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 12:38:53,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:53,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:53,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:53,925 INFO L175 MemorySlicer]: Split 233 memory accesses to 13 slices as follows [10, 2, 8, 7, 5, 6, 18, 3, 3, 2, 4, 4, 161]. 69 percent of accesses are in the largest equivalence class. The 48 initializations are split as follows [0, 2, 0, 7, 5, 6, 0, 3, 3, 2, 3, 3, 14]. The 80 writes are split as follows [0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 66]. [2024-11-07 12:38:53,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:53,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:53,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:54,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:54,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:54,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:54,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 12:38:54,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 12:38:54,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 12:38:54,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 12:38:54,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (1/1) ... [2024-11-07 12:38:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 12:38:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 12:38:54,097 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 12:38:54,104 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 12:38:54,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-11-07 12:38:54,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-11-07 12:38:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-11-07 12:38:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-11-07 12:38:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-11-07 12:38:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-07 12:38:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2024-11-07 12:38:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 12:38:54,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 12:38:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-07 12:38:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-07 12:38:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2024-11-07 12:38:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2024-11-07 12:38:54,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2024-11-07 12:38:54,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-07 12:38:54,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2024-11-07 12:38:54,139 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2024-11-07 12:38:54,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-07 12:38:54,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-11-07 12:38:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2024-11-07 12:38:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-11-07 12:38:54,140 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-07 12:38:54,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-11-07 12:38:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2024-11-07 12:38:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-11-07 12:38:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-11-07 12:38:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-11-07 12:38:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 12:38:54,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-11-07 12:38:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2024-11-07 12:38:54,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-11-07 12:38:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-11-07 12:38:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2024-11-07 12:38:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2024-11-07 12:38:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2024-11-07 12:38:54,145 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2024-11-07 12:38:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 12:38:54,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 12:38:54,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 12:38:54,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 12:38:59,824 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2024-11-07 12:38:59,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 12:38:59,848 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 12:38:59,851 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 12:38:59,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:38:59 BoogieIcfgContainer [2024-11-07 12:38:59,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 12:38:59,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 12:38:59,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 12:38:59,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 12:38:59,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:38:52" (1/3) ... [2024-11-07 12:38:59,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec63ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:38:59, skipping insertion in model container [2024-11-07 12:38:59,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:38:53" (2/3) ... [2024-11-07 12:38:59,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec63ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:38:59, skipping insertion in model container [2024-11-07 12:38:59,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:38:59" (3/3) ... [2024-11-07 12:38:59,863 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-11-07 12:38:59,878 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 12:38:59,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 12:38:59,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 12:38:59,960 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;@5f6906a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 12:38:59,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 12:38:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 233 states have internal predecessors, (295), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 12:38:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 12:38:59,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:38:59,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:38:59,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:38:59,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:38:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1860750501, now seen corresponding path program 1 times [2024-11-07 12:39:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:39:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994575543] [2024-11-07 12:39:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:39:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:39:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:39:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:39:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:39:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:39:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 12:39:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:39:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 12:39:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 12:39:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 12:39:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 12:39:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:39:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:39:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994575543] [2024-11-07 12:39:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994575543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:39:01,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:39:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 12:39:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213799825] [2024-11-07 12:39:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:39:01,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 12:39:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:39:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 12:39:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:39:01,401 INFO L87 Difference]: Start difference. First operand has 301 states, 227 states have (on average 1.2995594713656389) internal successors, (295), 233 states have internal predecessors, (295), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 12:39:05,426 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 12:39:09,435 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 12:39:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:39:10,712 INFO L93 Difference]: Finished difference Result 623 states and 849 transitions. [2024-11-07 12:39:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 12:39:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-11-07 12:39:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:39:10,729 INFO L225 Difference]: With dead ends: 623 [2024-11-07 12:39:10,729 INFO L226 Difference]: Without dead ends: 318 [2024-11-07 12:39:10,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:39:10,737 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 193 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 129 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:39:10,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1088 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 651 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-07 12:39:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-07 12:39:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 289. [2024-11-07 12:39:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 219 states have (on average 1.2831050228310503) internal successors, (281), 223 states have internal predecessors, (281), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 12:39:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 383 transitions. [2024-11-07 12:39:10,837 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 383 transitions. Word has length 126 [2024-11-07 12:39:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:39:10,839 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 383 transitions. [2024-11-07 12:39:10,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 12:39:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 383 transitions. [2024-11-07 12:39:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 12:39:10,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:39:10,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:39:10,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 12:39:10,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:39:10,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:39:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1568180097, now seen corresponding path program 1 times [2024-11-07 12:39:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:39:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812301430] [2024-11-07 12:39:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:39:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:39:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:39:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:39:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:39:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:39:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:39:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:39:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:39:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:39:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:39:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:39:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:39:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:39:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:39:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812301430] [2024-11-07 12:39:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812301430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:39:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:39:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:39:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978212793] [2024-11-07 12:39:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:39:11,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:39:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:39:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:39:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:39:11,455 INFO L87 Difference]: Start difference. First operand 289 states and 383 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:15,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:39:19,517 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 12:39:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:39:20,369 INFO L93 Difference]: Finished difference Result 600 states and 802 transitions. [2024-11-07 12:39:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 12:39:20,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2024-11-07 12:39:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:39:20,374 INFO L225 Difference]: With dead ends: 600 [2024-11-07 12:39:20,374 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 12:39:20,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:39:20,377 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 193 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 125 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:39:20,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 809 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-07 12:39:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 12:39:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 290. [2024-11-07 12:39:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 220 states have (on average 1.2818181818181817) internal successors, (282), 224 states have internal predecessors, (282), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 12:39:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 384 transitions. [2024-11-07 12:39:20,414 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 384 transitions. Word has length 137 [2024-11-07 12:39:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:39:20,414 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 384 transitions. [2024-11-07 12:39:20,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 384 transitions. [2024-11-07 12:39:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 12:39:20,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:39:20,418 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:39:20,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 12:39:20,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:39:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:39:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1668949121, now seen corresponding path program 1 times [2024-11-07 12:39:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:39:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448492782] [2024-11-07 12:39:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:39:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:39:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:39:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:39:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:39:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:39:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:39:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:39:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:39:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:39:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:39:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:39:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:39:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:39:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:39:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448492782] [2024-11-07 12:39:21,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448492782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:39:21,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:39:21,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 12:39:21,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292303129] [2024-11-07 12:39:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:39:21,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 12:39:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:39:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 12:39:21,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:39:21,076 INFO L87 Difference]: Start difference. First operand 290 states and 384 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:25,089 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 12:39:29,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:39:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:39:29,944 INFO L93 Difference]: Finished difference Result 603 states and 805 transitions. [2024-11-07 12:39:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 12:39:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2024-11-07 12:39:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:39:29,948 INFO L225 Difference]: With dead ends: 603 [2024-11-07 12:39:29,948 INFO L226 Difference]: Without dead ends: 321 [2024-11-07 12:39:29,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:39:29,950 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 193 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 123 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:39:29,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1015 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 643 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-07 12:39:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-07 12:39:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 292. [2024-11-07 12:39:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 222 states have (on average 1.2792792792792793) internal successors, (284), 226 states have internal predecessors, (284), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 12:39:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 386 transitions. [2024-11-07 12:39:29,969 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 386 transitions. Word has length 137 [2024-11-07 12:39:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:39:29,970 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 386 transitions. [2024-11-07 12:39:29,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 386 transitions. [2024-11-07 12:39:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 12:39:29,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:39:29,973 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:39:29,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 12:39:29,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:39:29,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:39:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1691581375, now seen corresponding path program 1 times [2024-11-07 12:39:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:39:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062406847] [2024-11-07 12:39:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:39:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:39:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:39:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:39:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:39:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:39:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:39:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:39:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:39:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:39:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:39:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:39:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:39:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:39:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:39:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062406847] [2024-11-07 12:39:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062406847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:39:30,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:39:30,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:39:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001931944] [2024-11-07 12:39:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:39:30,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:39:30,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:39:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:39:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:39:30,486 INFO L87 Difference]: Start difference. First operand 292 states and 386 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:34,500 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 12:39:38,507 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 12:39:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:39:39,218 INFO L93 Difference]: Finished difference Result 606 states and 808 transitions. [2024-11-07 12:39:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 12:39:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2024-11-07 12:39:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:39:39,223 INFO L225 Difference]: With dead ends: 606 [2024-11-07 12:39:39,224 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 12:39:39,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:39:39,227 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 193 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 123 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 12:39:39,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 809 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 12:39:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 12:39:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 293. [2024-11-07 12:39:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 227 states have internal predecessors, (285), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 12:39:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2024-11-07 12:39:39,276 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 137 [2024-11-07 12:39:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:39:39,277 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2024-11-07 12:39:39,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2024-11-07 12:39:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 12:39:39,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:39:39,282 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:39:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 12:39:39,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:39:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:39:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1901786047, now seen corresponding path program 1 times [2024-11-07 12:39:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:39:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528500331] [2024-11-07 12:39:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:39:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:39:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:39:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:39:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:39:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:39:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:39:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:39:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:39:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:39:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:39:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:39:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:39:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:39:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:39:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528500331] [2024-11-07 12:39:40,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528500331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:39:40,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:39:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 12:39:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525769784] [2024-11-07 12:39:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:39:40,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 12:39:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:39:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 12:39:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:39:40,280 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:44,293 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 12:39:48,301 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 12:39:52,311 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 12:39:56,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:39:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:39:58,365 INFO L93 Difference]: Finished difference Result 944 states and 1269 transitions. [2024-11-07 12:39:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 12:39:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2024-11-07 12:39:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:39:58,373 INFO L225 Difference]: With dead ends: 944 [2024-11-07 12:39:58,373 INFO L226 Difference]: Without dead ends: 940 [2024-11-07 12:39:58,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-07 12:39:58,375 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1217 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 458 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:39:58,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1268 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 908 Invalid, 4 Unknown, 0 Unchecked, 17.8s Time] [2024-11-07 12:39:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-07 12:39:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 853. [2024-11-07 12:39:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 651 states have (on average 1.2795698924731183) internal successors, (833), 661 states have internal predecessors, (833), 150 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (152), 148 states have call predecessors, (152), 148 states have call successors, (152) [2024-11-07 12:39:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1135 transitions. [2024-11-07 12:39:58,446 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1135 transitions. Word has length 137 [2024-11-07 12:39:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:39:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1135 transitions. [2024-11-07 12:39:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:39:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1135 transitions. [2024-11-07 12:39:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 12:39:58,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:39:58,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:39:58,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 12:39:58,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:39:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:39:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -970050414, now seen corresponding path program 1 times [2024-11-07 12:39:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:39:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677189563] [2024-11-07 12:39:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:58,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:39:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:39:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:39:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:39:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:39:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:39:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:39:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:39:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:39:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:39:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:39:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:39:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:39:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:39:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:39:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 12:39:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:39:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:39:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677189563] [2024-11-07 12:39:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677189563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 12:39:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303936088] [2024-11-07 12:39:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:39:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 12:39:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 12:39:59,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 12:39:59,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 12:39:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:39:59,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 12:39:59,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 12:40:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 12:40:00,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 12:40:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303936088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 12:40:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-07 12:40:00,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84806911] [2024-11-07 12:40:00,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:00,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 12:40:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:00,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 12:40:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:40:00,066 INFO L87 Difference]: Start difference. First operand 853 states and 1135 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 12:40:04,081 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 12:40:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:04,158 INFO L93 Difference]: Finished difference Result 1700 states and 2265 transitions. [2024-11-07 12:40:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 12:40:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 147 [2024-11-07 12:40:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:04,170 INFO L225 Difference]: With dead ends: 1700 [2024-11-07 12:40:04,170 INFO L226 Difference]: Without dead ends: 1415 [2024-11-07 12:40:04,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:40:04,173 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 363 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:04,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1094 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-11-07 12:40:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-07 12:40:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1133. [2024-11-07 12:40:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 865 states have (on average 1.2786127167630057) internal successors, (1106), 878 states have internal predecessors, (1106), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2024-11-07 12:40:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1506 transitions. [2024-11-07 12:40:04,255 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1506 transitions. Word has length 147 [2024-11-07 12:40:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:04,256 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1506 transitions. [2024-11-07 12:40:04,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 12:40:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1506 transitions. [2024-11-07 12:40:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 12:40:04,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:04,260 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:04,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 12:40:04,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 12:40:04,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:04,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 395986029, now seen corresponding path program 1 times [2024-11-07 12:40:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407373004] [2024-11-07 12:40:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:40:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:40:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:04,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:40:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:40:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:40:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:40:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:40:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:40:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:40:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:40:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:40:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 12:40:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 12:40:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 12:40:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-07 12:40:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:05,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407373004] [2024-11-07 12:40:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407373004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:05,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:05,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 12:40:05,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127427517] [2024-11-07 12:40:05,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 12:40:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:05,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 12:40:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:40:05,088 INFO L87 Difference]: Start difference. First operand 1133 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 12:40:09,099 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 12:40:13,111 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 12:40:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:14,066 INFO L93 Difference]: Finished difference Result 2382 states and 3187 transitions. [2024-11-07 12:40:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 12:40:14,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 193 [2024-11-07 12:40:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:14,075 INFO L225 Difference]: With dead ends: 2382 [2024-11-07 12:40:14,075 INFO L226 Difference]: Without dead ends: 1257 [2024-11-07 12:40:14,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:40:14,080 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 208 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 124 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:14,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 996 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 639 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-07 12:40:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-07 12:40:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1141. [2024-11-07 12:40:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 873 states have (on average 1.2760595647193584) internal successors, (1114), 886 states have internal predecessors, (1114), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2024-11-07 12:40:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1514 transitions. [2024-11-07 12:40:14,186 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1514 transitions. Word has length 193 [2024-11-07 12:40:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1514 transitions. [2024-11-07 12:40:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 12:40:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1514 transitions. [2024-11-07 12:40:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 12:40:14,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:14,192 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:14,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 12:40:14,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:14,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1970708565, now seen corresponding path program 1 times [2024-11-07 12:40:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675731000] [2024-11-07 12:40:14,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:14,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:40:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 12:40:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 12:40:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 12:40:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:40:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:40:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 12:40:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:40:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 12:40:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:40:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 12:40:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 12:40:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 12:40:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 12:40:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-07 12:40:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675731000] [2024-11-07 12:40:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675731000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:14,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:40:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460316375] [2024-11-07 12:40:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:14,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:40:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:40:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:40:14,687 INFO L87 Difference]: Start difference. First operand 1141 states and 1514 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 12:40:18,699 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 12:40:22,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:40:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:23,604 INFO L93 Difference]: Finished difference Result 2394 states and 3199 transitions. [2024-11-07 12:40:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 12:40:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 193 [2024-11-07 12:40:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:23,613 INFO L225 Difference]: With dead ends: 2394 [2024-11-07 12:40:23,613 INFO L226 Difference]: Without dead ends: 1261 [2024-11-07 12:40:23,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:40:23,618 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 193 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 121 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:23,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 808 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 469 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-07 12:40:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2024-11-07 12:40:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1145. [2024-11-07 12:40:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 877 states have (on average 1.274800456100342) internal successors, (1118), 890 states have internal predecessors, (1118), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2024-11-07 12:40:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1518 transitions. [2024-11-07 12:40:23,679 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1518 transitions. Word has length 193 [2024-11-07 12:40:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:23,680 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1518 transitions. [2024-11-07 12:40:23,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 12:40:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1518 transitions. [2024-11-07 12:40:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 12:40:23,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:23,684 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 12:40:23,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1971170349, now seen corresponding path program 1 times [2024-11-07 12:40:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257323220] [2024-11-07 12:40:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms