./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-11 15:10:17,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:10:17,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:10:17,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:10:17,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:10:17,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:10:17,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:10:17,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:10:17,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:10:17,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:10:17,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:10:17,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:10:17,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:10:17,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:10:17,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:10:17,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:10:17,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:10:17,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:10:17,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:10:17,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:10:17,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:10:17,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:10:17,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:10:17,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:10:17,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:10:17,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:10:17,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:10:17,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:10:17,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:10:17,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:10:17,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:10:17,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:10:17,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:10:17,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:10:17,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:10:17,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:10:17,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:10:17,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:10:17,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:10:17,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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-10-11 15:10:17,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:10:17,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:10:17,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:10:17,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:10:17,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:10:17,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-10-11 15:10:19,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:10:19,677 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:10:19,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-10-11 15:10:19,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1cb2200d7/d43f2f3fcfb44d97850db11246090f58/FLAG3dd245d75 [2024-10-11 15:10:19,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1cb2200d7/d43f2f3fcfb44d97850db11246090f58 [2024-10-11 15:10:19,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:10:19,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:10:19,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:10:19,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:10:19,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:10:19,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:19" (1/1) ... [2024-10-11 15:10:19,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6838dc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:19, skipping insertion in model container [2024-10-11 15:10:19,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:19" (1/1) ... [2024-10-11 15:10:19,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:10:20,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2024-10-11 15:10:20,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:10:20,547 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:10:20,692 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2024-10-11 15:10:20,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:10:20,734 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:10:20,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20 WrapperNode [2024-10-11 15:10:20,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:10:20,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:10:20,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:10:20,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:10:20,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:20,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:20,861 INFO L138 Inliner]: procedures = 102, calls = 421, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1152 [2024-10-11 15:10:20,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:10:20,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:10:20,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:10:20,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:10:20,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:20,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:20,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,029 INFO L175 MemorySlicer]: Split 229 memory accesses to 13 slices as follows [2, 157, 7, 5, 6, 8, 3, 3, 2, 4, 10, 4, 18]. 69 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [2, 42, 7, 5, 6, 0, 3, 3, 2, 3, 0, 3, 0]. The 48 writes are split as follows [0, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14]. [2024-10-11 15:10:21,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:10:21,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:10:21,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:10:21,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:10:21,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (1/1) ... [2024-10-11 15:10:21,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:10:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:10:21,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:10:21,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:10:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:10:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:10:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:10:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:10:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:10:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:10:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:10:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:10:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 15:10:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 15:10:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-11 15:10:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-11 15:10:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-11 15:10:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:10:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:10:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:10:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:10:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:10:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:10:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:10:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:10:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-11 15:10:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-11 15:10:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-10-11 15:10:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2024-10-11 15:10:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2024-10-11 15:10:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:10:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:10:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:10:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:10:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:10:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2024-10-11 15:10:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:10:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:10:21,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:10:21,227 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:10:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:10:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:10:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:10:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:10:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:10:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:10:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:10:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:10:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:10:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 15:10:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 15:10:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 15:10:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:10:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:10:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2024-10-11 15:10:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2024-10-11 15:10:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:10:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:10:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2024-10-11 15:10:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2024-10-11 15:10:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:10:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:10:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:10:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:10:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:10:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:10:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:10:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:10:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:10:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:10:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 15:10:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 15:10:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 15:10:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2024-10-11 15:10:21,234 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2024-10-11 15:10:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:10:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2024-10-11 15:10:21,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:10:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 15:10:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-11 15:10:21,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-11 15:10:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2024-10-11 15:10:21,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2024-10-11 15:10:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2024-10-11 15:10:21,237 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2024-10-11 15:10:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:10:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-11 15:10:21,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-11 15:10:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2024-10-11 15:10:21,239 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2024-10-11 15:10:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 15:10:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 15:10:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-11 15:10:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-11 15:10:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 15:10:21,240 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:10:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:10:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:10:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:10:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:10:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 15:10:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 15:10:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 15:10:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-11 15:10:21,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-11 15:10:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2024-10-11 15:10:21,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2024-10-11 15:10:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:10:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:10:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:10:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:10:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:10:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:10:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:10:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:10:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-11 15:10:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-11 15:10:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-10-11 15:10:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2024-10-11 15:10:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2024-10-11 15:10:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2024-10-11 15:10:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2024-10-11 15:10:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:10:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:10:21,595 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:10:21,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:10:22,747 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2024-10-11 15:10:22,747 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:10:22,857 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:10:22,859 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 15:10:22,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:22 BoogieIcfgContainer [2024-10-11 15:10:22,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:10:22,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:10:22,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:10:22,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:10:22,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:10:19" (1/3) ... [2024-10-11 15:10:22,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b4bf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:22, skipping insertion in model container [2024-10-11 15:10:22,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:20" (2/3) ... [2024-10-11 15:10:22,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b4bf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:22, skipping insertion in model container [2024-10-11 15:10:22,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:22" (3/3) ... [2024-10-11 15:10:22,870 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2024-10-11 15:10:22,886 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:10:22,887 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:10:22,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:10:22,964 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;@78cd4301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:10:22,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:10:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 174 states have internal predecessors, (236), 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-10-11 15:10:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 15:10:22,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:22,987 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 15:10:22,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1637811404, now seen corresponding path program 1 times [2024-10-11 15:10:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013992218] [2024-10-11 15:10:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:23,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 15:10:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 15:10:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:10:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 15:10:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:10:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:23,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:23,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013992218] [2024-10-11 15:10:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013992218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746062216] [2024-10-11 15:10:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:23,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:23,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:23,841 INFO L87 Difference]: Start difference. First operand has 242 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 174 states have internal predecessors, (236), 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 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-10-11 15:10:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:25,107 INFO L93 Difference]: Finished difference Result 504 states and 730 transitions. [2024-10-11 15:10:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 99 [2024-10-11 15:10:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:25,126 INFO L225 Difference]: With dead ends: 504 [2024-10-11 15:10:25,127 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 15:10:25,132 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-10-11 15:10:25,135 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 142 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:25,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 811 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:10:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 15:10:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 236. [2024-10-11 15:10:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 166 states have (on average 1.3734939759036144) internal successors, (228), 170 states have internal predecessors, (228), 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-10-11 15:10:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2024-10-11 15:10:25,211 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 99 [2024-10-11 15:10:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:25,212 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2024-10-11 15:10:25,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-10-11 15:10:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2024-10-11 15:10:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 15:10:25,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:25,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 15:10:25,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:10:25,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:25,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1163858420, now seen corresponding path program 1 times [2024-10-11 15:10:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:25,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54871007] [2024-10-11 15:10:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:25,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:25,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54871007] [2024-10-11 15:10:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54871007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:25,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:10:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445098835] [2024-10-11 15:10:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:10:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:10:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:10:25,614 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 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-10-11 15:10:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:26,728 INFO L93 Difference]: Finished difference Result 492 states and 694 transitions. [2024-10-11 15:10:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:10:26,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 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 105 [2024-10-11 15:10:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:26,732 INFO L225 Difference]: With dead ends: 492 [2024-10-11 15:10:26,733 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 15:10:26,734 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-10-11 15:10:26,735 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 142 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:26,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 619 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:10:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 15:10:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2024-10-11 15:10:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 167 states have (on average 1.3712574850299402) internal successors, (229), 171 states have internal predecessors, (229), 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-10-11 15:10:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 331 transitions. [2024-10-11 15:10:26,769 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 331 transitions. Word has length 105 [2024-10-11 15:10:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:26,771 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 331 transitions. [2024-10-11 15:10:26,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 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-10-11 15:10:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2024-10-11 15:10:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 15:10:26,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:26,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 15:10:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:10:26,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:26,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1109465522, now seen corresponding path program 1 times [2024-10-11 15:10:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25596678] [2024-10-11 15:10:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25596678] [2024-10-11 15:10:27,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25596678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:27,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:27,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:27,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808729609] [2024-10-11 15:10:27,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:27,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:27,176 INFO L87 Difference]: Start difference. First operand 237 states and 331 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 15:10:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:28,193 INFO L93 Difference]: Finished difference Result 495 states and 697 transitions. [2024-10-11 15:10:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 105 [2024-10-11 15:10:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:28,197 INFO L225 Difference]: With dead ends: 495 [2024-10-11 15:10:28,197 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 15:10:28,198 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-10-11 15:10:28,200 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 142 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:28,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 777 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 15:10:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 15:10:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 239. [2024-10-11 15:10:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 173 states have internal predecessors, (231), 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-10-11 15:10:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2024-10-11 15:10:28,225 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 105 [2024-10-11 15:10:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:28,225 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2024-10-11 15:10:28,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 15:10:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2024-10-11 15:10:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 15:10:28,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:28,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 15:10:28,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:10:28,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:28,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1262273740, now seen corresponding path program 1 times [2024-10-11 15:10:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:28,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937345142] [2024-10-11 15:10:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937345142] [2024-10-11 15:10:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937345142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:10:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123285336] [2024-10-11 15:10:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:28,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:10:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:28,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:10:28,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:10:28,483 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 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-10-11 15:10:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:29,370 INFO L93 Difference]: Finished difference Result 498 states and 700 transitions. [2024-10-11 15:10:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:10:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 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 105 [2024-10-11 15:10:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:29,373 INFO L225 Difference]: With dead ends: 498 [2024-10-11 15:10:29,373 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 15:10:29,374 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-10-11 15:10:29,375 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 142 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:29,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 618 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 15:10:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 15:10:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 240. [2024-10-11 15:10:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 174 states have internal predecessors, (232), 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-10-11 15:10:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 334 transitions. [2024-10-11 15:10:29,399 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 334 transitions. Word has length 105 [2024-10-11 15:10:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:29,400 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 334 transitions. [2024-10-11 15:10:29,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 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-10-11 15:10:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 334 transitions. [2024-10-11 15:10:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 15:10:29,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:29,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 15:10:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:10:29,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1771746830, now seen corresponding path program 1 times [2024-10-11 15:10:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510299004] [2024-10-11 15:10:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510299004] [2024-10-11 15:10:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510299004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202229274] [2024-10-11 15:10:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:29,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:29,891 INFO L87 Difference]: Start difference. First operand 240 states and 334 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 15:10:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:31,749 INFO L93 Difference]: Finished difference Result 775 states and 1100 transitions. [2024-10-11 15:10:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 15:10:31,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 105 [2024-10-11 15:10:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:31,757 INFO L225 Difference]: With dead ends: 775 [2024-10-11 15:10:31,758 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 15:10:31,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 15:10:31,763 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 784 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:31,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 897 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 15:10:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 15:10:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 702. [2024-10-11 15:10:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 500 states have (on average 1.364) internal successors, (682), 510 states have internal predecessors, (682), 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-10-11 15:10:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 984 transitions. [2024-10-11 15:10:31,830 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 984 transitions. Word has length 105 [2024-10-11 15:10:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:31,833 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 984 transitions. [2024-10-11 15:10:31,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-11 15:10:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 984 transitions. [2024-10-11 15:10:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 15:10:31,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:31,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:10:31,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:31,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash 450287181, now seen corresponding path program 1 times [2024-10-11 15:10:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670244432] [2024-10-11 15:10:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:32,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:32,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670244432] [2024-10-11 15:10:32,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670244432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:10:32,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358902113] [2024-10-11 15:10:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:32,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:10:32,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:10:32,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:10:32,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:10:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:32,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 15:10:32,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:10:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:10:32,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:10:32,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358902113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:32,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:10:32,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:10:32,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064937362] [2024-10-11 15:10:32,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:32,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:10:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:10:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:10:32,787 INFO L87 Difference]: Start difference. First operand 702 states and 984 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-10-11 15:10:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:33,228 INFO L93 Difference]: Finished difference Result 1402 states and 1967 transitions. [2024-10-11 15:10:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:10:33,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 113 [2024-10-11 15:10:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:33,235 INFO L225 Difference]: With dead ends: 1402 [2024-10-11 15:10:33,236 INFO L226 Difference]: Without dead ends: 1166 [2024-10-11 15:10:33,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-10-11 15:10:33,240 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 316 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:33,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 819 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:10:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-10-11 15:10:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 933. [2024-10-11 15:10:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 665 states have (on average 1.362406015037594) internal successors, (906), 678 states have internal predecessors, (906), 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-10-11 15:10:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1306 transitions. [2024-10-11 15:10:33,306 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1306 transitions. Word has length 113 [2024-10-11 15:10:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:33,306 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1306 transitions. [2024-10-11 15:10:33,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-10-11 15:10:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1306 transitions. [2024-10-11 15:10:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 15:10:33,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:33,309 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:33,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 15:10:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:10:33,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:33,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1652180295, now seen corresponding path program 1 times [2024-10-11 15:10:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:33,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653812017] [2024-10-11 15:10:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:10:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 15:10:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653812017] [2024-10-11 15:10:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653812017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:33,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:33,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546522153] [2024-10-11 15:10:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:33,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:33,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:33,865 INFO L87 Difference]: Start difference. First operand 933 states and 1306 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-10-11 15:10:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:35,038 INFO L93 Difference]: Finished difference Result 1962 states and 2767 transitions. [2024-10-11 15:10:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 151 [2024-10-11 15:10:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:35,046 INFO L225 Difference]: With dead ends: 1962 [2024-10-11 15:10:35,047 INFO L226 Difference]: Without dead ends: 1033 [2024-10-11 15:10:35,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-10-11 15:10:35,052 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 142 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:35,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 788 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 15:10:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-10-11 15:10:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 941. [2024-10-11 15:10:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 673 states have (on average 1.3580980683506687) internal successors, (914), 686 states have internal predecessors, (914), 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-10-11 15:10:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1314 transitions. [2024-10-11 15:10:35,116 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1314 transitions. Word has length 151 [2024-10-11 15:10:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:35,117 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1314 transitions. [2024-10-11 15:10:35,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-10-11 15:10:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1314 transitions. [2024-10-11 15:10:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 15:10:35,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:35,121 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:35,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:10:35,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1538583004, now seen corresponding path program 1 times [2024-10-11 15:10:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:35,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611395407] [2024-10-11 15:10:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:35,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:10:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 15:10:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611395407] [2024-10-11 15:10:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611395407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606297833] [2024-10-11 15:10:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:35,543 INFO L87 Difference]: Start difference. First operand 941 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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-10-11 15:10:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:36,758 INFO L93 Difference]: Finished difference Result 1978 states and 2783 transitions. [2024-10-11 15:10:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:36,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 152 [2024-10-11 15:10:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:36,765 INFO L225 Difference]: With dead ends: 1978 [2024-10-11 15:10:36,766 INFO L226 Difference]: Without dead ends: 1041 [2024-10-11 15:10:36,768 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-10-11 15:10:36,769 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 155 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:36,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 763 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:10:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-10-11 15:10:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 949. [2024-10-11 15:10:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.353891336270191) internal successors, (922), 694 states have internal predecessors, (922), 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-10-11 15:10:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1322 transitions. [2024-10-11 15:10:36,824 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1322 transitions. Word has length 152 [2024-10-11 15:10:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:36,824 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1322 transitions. [2024-10-11 15:10:36,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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-10-11 15:10:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1322 transitions. [2024-10-11 15:10:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 15:10:36,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:36,827 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:36,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:10:36,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:36,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1114936282, now seen corresponding path program 1 times [2024-10-11 15:10:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332758107] [2024-10-11 15:10:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:10:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 15:10:37,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:37,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332758107] [2024-10-11 15:10:37,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332758107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:37,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:37,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:10:37,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676483067] [2024-10-11 15:10:37,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:37,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:10:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:10:37,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:10:37,119 INFO L87 Difference]: Start difference. First operand 949 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 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-10-11 15:10:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:38,122 INFO L93 Difference]: Finished difference Result 1990 states and 2795 transitions. [2024-10-11 15:10:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:10:38,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 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 152 [2024-10-11 15:10:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:38,129 INFO L225 Difference]: With dead ends: 1990 [2024-10-11 15:10:38,129 INFO L226 Difference]: Without dead ends: 1045 [2024-10-11 15:10:38,131 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-10-11 15:10:38,133 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 142 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:38,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 617 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 15:10:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2024-10-11 15:10:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 953. [2024-10-11 15:10:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 685 states have (on average 1.3518248175182481) internal successors, (926), 698 states have internal predecessors, (926), 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-10-11 15:10:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1326 transitions. [2024-10-11 15:10:38,209 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1326 transitions. Word has length 152 [2024-10-11 15:10:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:38,210 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1326 transitions. [2024-10-11 15:10:38,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 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-10-11 15:10:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1326 transitions. [2024-10-11 15:10:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 15:10:38,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:38,212 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:10:38,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash -866789788, now seen corresponding path program 1 times [2024-10-11 15:10:38,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:38,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727940931] [2024-10-11 15:10:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:10:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 15:10:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727940931] [2024-10-11 15:10:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727940931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094228439] [2024-10-11 15:10:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:38,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:38,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:38,512 INFO L87 Difference]: Start difference. First operand 953 states and 1326 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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-10-11 15:10:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:39,822 INFO L93 Difference]: Finished difference Result 2002 states and 2807 transitions. [2024-10-11 15:10:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 152 [2024-10-11 15:10:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:39,830 INFO L225 Difference]: With dead ends: 2002 [2024-10-11 15:10:39,830 INFO L226 Difference]: Without dead ends: 1053 [2024-10-11 15:10:39,833 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-10-11 15:10:39,833 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 142 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:39,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 785 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 15:10:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-10-11 15:10:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 961. [2024-10-11 15:10:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 693 states have (on average 1.3477633477633477) internal successors, (934), 706 states have internal predecessors, (934), 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-10-11 15:10:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1334 transitions. [2024-10-11 15:10:39,887 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1334 transitions. Word has length 152 [2024-10-11 15:10:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:39,891 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1334 transitions. [2024-10-11 15:10:39,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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-10-11 15:10:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1334 transitions. [2024-10-11 15:10:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 15:10:39,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:39,894 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:39,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:10:39,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 416828076, now seen corresponding path program 1 times [2024-10-11 15:10:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527607722] [2024-10-11 15:10:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:39,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 15:10:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 15:10:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527607722] [2024-10-11 15:10:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527607722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235562904] [2024-10-11 15:10:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:40,232 INFO L87 Difference]: Start difference. First operand 961 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 3 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-10-11 15:10:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:41,462 INFO L93 Difference]: Finished difference Result 2278 states and 3229 transitions. [2024-10-11 15:10:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 3 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 152 [2024-10-11 15:10:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:41,471 INFO L225 Difference]: With dead ends: 2278 [2024-10-11 15:10:41,471 INFO L226 Difference]: Without dead ends: 1321 [2024-10-11 15:10:41,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:10:41,475 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 215 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:41,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1046 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:10:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2024-10-11 15:10:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1028. [2024-10-11 15:10:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 752 states have (on average 1.3550531914893618) internal successors, (1019), 765 states have internal predecessors, (1019), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2024-10-11 15:10:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1435 transitions. [2024-10-11 15:10:41,532 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1435 transitions. Word has length 152 [2024-10-11 15:10:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:41,532 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1435 transitions. [2024-10-11 15:10:41,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 3 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-10-11 15:10:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1435 transitions. [2024-10-11 15:10:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 15:10:41,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:41,535 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:41,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 15:10:41,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:41,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash -539901550, now seen corresponding path program 1 times [2024-10-11 15:10:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:41,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137980644] [2024-10-11 15:10:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 15:10:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 15:10:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137980644] [2024-10-11 15:10:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137980644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:41,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943518859] [2024-10-11 15:10:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:41,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:41,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:41,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:41,924 INFO L87 Difference]: Start difference. First operand 1028 states and 1435 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 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-10-11 15:10:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:43,336 INFO L93 Difference]: Finished difference Result 2337 states and 3306 transitions. [2024-10-11 15:10:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 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 153 [2024-10-11 15:10:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:43,348 INFO L225 Difference]: With dead ends: 2337 [2024-10-11 15:10:43,348 INFO L226 Difference]: Without dead ends: 1313 [2024-10-11 15:10:43,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:10:43,352 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 209 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:43,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1009 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 15:10:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-11 15:10:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1020. [2024-10-11 15:10:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 744 states have (on average 1.342741935483871) internal successors, (999), 757 states have internal predecessors, (999), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2024-10-11 15:10:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1415 transitions. [2024-10-11 15:10:43,412 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1415 transitions. Word has length 153 [2024-10-11 15:10:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:43,413 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1415 transitions. [2024-10-11 15:10:43,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 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-10-11 15:10:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1415 transitions. [2024-10-11 15:10:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 15:10:43,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:43,416 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:10:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 15:10:43,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1997944823, now seen corresponding path program 1 times [2024-10-11 15:10:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402003084] [2024-10-11 15:10:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 15:10:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 15:10:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402003084] [2024-10-11 15:10:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402003084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:10:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849038191] [2024-10-11 15:10:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:43,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:10:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:10:43,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:10:43,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:10:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:44,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 15:10:44,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:10:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 15:10:44,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:10:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 15:10:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849038191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:10:44,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:10:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-10-11 15:10:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657913284] [2024-10-11 15:10:44,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:10:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:10:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:10:44,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:10:44,620 INFO L87 Difference]: Start difference. First operand 1020 states and 1415 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 15:10:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:45,882 INFO L93 Difference]: Finished difference Result 2562 states and 3655 transitions. [2024-10-11 15:10:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:10:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-10-11 15:10:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:45,892 INFO L225 Difference]: With dead ends: 2562 [2024-10-11 15:10:45,893 INFO L226 Difference]: Without dead ends: 1546 [2024-10-11 15:10:45,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:10:45,897 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 241 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:45,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 976 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 15:10:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-10-11 15:10:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1332. [2024-10-11 15:10:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1008 states have (on average 1.3482142857142858) internal successors, (1359), 1021 states have internal predecessors, (1359), 255 states have call successors, (255), 69 states have call predecessors, (255), 68 states have return successors, (257), 253 states have call predecessors, (257), 253 states have call successors, (257) [2024-10-11 15:10:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1871 transitions. [2024-10-11 15:10:45,972 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1871 transitions. Word has length 153 [2024-10-11 15:10:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:45,972 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1871 transitions. [2024-10-11 15:10:45,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 15:10:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1871 transitions. [2024-10-11 15:10:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 15:10:45,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:45,977 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-10-11 15:10:46,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 15:10:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:10:46,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1421034742, now seen corresponding path program 1 times [2024-10-11 15:10:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424781280] [2024-10-11 15:10:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 15:10:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 15:10:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-11 15:10:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424781280] [2024-10-11 15:10:46,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424781280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:46,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:46,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:10:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930084190] [2024-10-11 15:10:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:10:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:10:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:10:46,602 INFO L87 Difference]: Start difference. First operand 1332 states and 1871 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:10:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:48,424 INFO L93 Difference]: Finished difference Result 3397 states and 4821 transitions. [2024-10-11 15:10:48,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 15:10:48,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2024-10-11 15:10:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:48,432 INFO L225 Difference]: With dead ends: 3397 [2024-10-11 15:10:48,433 INFO L226 Difference]: Without dead ends: 1021 [2024-10-11 15:10:48,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 15:10:48,439 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 402 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:48,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1678 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 15:10:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-11 15:10:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 927. [2024-10-11 15:10:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 695 states have (on average 1.3122302158273382) internal successors, (912), 705 states have internal predecessors, (912), 180 states have call successors, (180), 52 states have call predecessors, (180), 51 states have return successors, (180), 178 states have call predecessors, (180), 178 states have call successors, (180) [2024-10-11 15:10:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1272 transitions. [2024-10-11 15:10:48,491 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1272 transitions. Word has length 162 [2024-10-11 15:10:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:48,492 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1272 transitions. [2024-10-11 15:10:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:10:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1272 transitions. [2024-10-11 15:10:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 15:10:48,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:48,495 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 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] [2024-10-11 15:10:48,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 15:10:48,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:48,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1108713247, now seen corresponding path program 1 times [2024-10-11 15:10:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635011451] [2024-10-11 15:10:48,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:48,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 15:10:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 15:10:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 15:10:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-11 15:10:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635011451] [2024-10-11 15:10:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635011451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:10:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452603981] [2024-10-11 15:10:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:10:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:10:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:10:48,940 INFO L87 Difference]: Start difference. First operand 927 states and 1272 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:10:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:49,749 INFO L93 Difference]: Finished difference Result 1857 states and 2569 transitions. [2024-10-11 15:10:49,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:10:49,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 181 [2024-10-11 15:10:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:49,755 INFO L225 Difference]: With dead ends: 1857 [2024-10-11 15:10:49,755 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 15:10:49,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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-10-11 15:10:49,760 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 156 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:49,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 756 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 15:10:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 15:10:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 851. [2024-10-11 15:10:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 627 states have (on average 1.3014354066985645) internal successors, (816), 637 states have internal predecessors, (816), 172 states have call successors, (172), 52 states have call predecessors, (172), 51 states have return successors, (172), 170 states have call predecessors, (172), 170 states have call successors, (172) [2024-10-11 15:10:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1160 transitions. [2024-10-11 15:10:49,814 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1160 transitions. Word has length 181 [2024-10-11 15:10:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:49,815 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1160 transitions. [2024-10-11 15:10:49,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:10:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1160 transitions. [2024-10-11 15:10:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-11 15:10:49,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:49,819 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 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] [2024-10-11 15:10:49,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 15:10:49,819 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:10:49,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 58714759, now seen corresponding path program 1 times [2024-10-11 15:10:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:49,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136791267] [2024-10-11 15:10:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 15:10:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:10:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:10:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:10:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:10:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:10:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:10:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:10:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:10:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:10:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:10:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:10:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 15:10:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 15:10:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 15:10:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 15:10:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-11 15:10:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136791267] [2024-10-11 15:10:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136791267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:50,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:10:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802831810] [2024-10-11 15:10:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:50,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:10:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:10:50,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:10:50,525 INFO L87 Difference]: Start difference. First operand 851 states and 1160 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 5 states have internal predecessors, (106), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 15:10:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:10:51,846 INFO L93 Difference]: Finished difference Result 1225 states and 1704 transitions. [2024-10-11 15:10:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 15:10:51,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 5 states have internal predecessors, (106), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 193 [2024-10-11 15:10:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:10:51,849 INFO L225 Difference]: With dead ends: 1225 [2024-10-11 15:10:51,849 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 15:10:51,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:10:51,852 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1184 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:10:51,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 628 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 15:10:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 15:10:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 15:10:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:10:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 15:10:51,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2024-10-11 15:10:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:10:51,855 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 15:10:51,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 5 states have internal predecessors, (106), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 15:10:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 15:10:51,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 15:10:51,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:10:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 15:10:51,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:10:51,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.