./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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.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 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:34:38,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:34:38,901 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:34:38,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:34:38,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:34:38,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:34:38,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:34:38,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:34:38,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:34:38,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:34:38,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:34:38,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:34:38,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:34:38,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:34:38,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:34:38,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:34:38,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:34:38,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:34:38,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:34:38,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:34:38,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:34:38,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:34:38,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:34:38,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:34:38,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:34:38,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:34:38,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:34:38,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:34:38,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:34:38,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:34:38,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:34:38,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:34:38,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:34:38,961 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 -> 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b [2024-10-11 15:34:39,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:34:39,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:34:39,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:34:39,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:34:39,172 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:34:39,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2024-10-11 15:34:40,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:34:40,766 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:34:40,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2024-10-11 15:34:40,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/202d6d540/d97d4f4613264434bafe668c282f7508/FLAGf0db5e93e [2024-10-11 15:34:40,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/202d6d540/d97d4f4613264434bafe668c282f7508 [2024-10-11 15:34:40,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:34:40,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:34:40,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:34:40,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:34:40,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:34:40,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:34:40" (1/1) ... [2024-10-11 15:34:40,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3760572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:40, skipping insertion in model container [2024-10-11 15:34:40,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:34:40" (1/1) ... [2024-10-11 15:34:40,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:34:41,557 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i[185252,185265] [2024-10-11 15:34:41,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:34:41,700 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:34:41,827 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i[185252,185265] [2024-10-11 15:34:41,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:34:41,882 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:34:41,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41 WrapperNode [2024-10-11 15:34:41,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:34:41,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:34:41,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:34:41,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:34:41,889 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:34:41" (1/1) ... [2024-10-11 15:34:41,928 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:34:41" (1/1) ... [2024-10-11 15:34:41,981 INFO L138 Inliner]: procedures = 117, calls = 568, calls flagged for inlining = 30, calls inlined = 25, statements flattened = 1109 [2024-10-11 15:34:41,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:34:41,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:34:41,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:34:41,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:34:41,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:41,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,040 INFO L175 MemorySlicer]: Split 403 memory accesses to 13 slices as follows [2, 3, 19, 19, 19, 19, 19, 19, 3, 19, 19, 43, 200]. 50 percent of accesses are in the largest equivalence class. The 397 initializations are split as follows [2, 0, 19, 19, 19, 19, 19, 19, 0, 19, 19, 43, 200]. The 3 writes are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]. [2024-10-11 15:34:42,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:34:42,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:34:42,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:34:42,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:34:42,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (1/1) ... [2024-10-11 15:34:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:34:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:34:42,136 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:34:42,138 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:34:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:34:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:34:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:34:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 15:34:42,170 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2024-10-11 15:34:42,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2024-10-11 15:34:42,170 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2024-10-11 15:34:42,170 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:34:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-10-11 15:34:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:34:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev [2024-10-11 15:34:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev [2024-10-11 15:34:42,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-11 15:34:42,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 15:34:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:34:42,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 15:34:42,174 INFO L130 BoogieDeclarations]: Found specification of procedure always_connected [2024-10-11 15:34:42,175 INFO L138 BoogieDeclarations]: Found implementation of procedure always_connected [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:34:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:34:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:34:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:34:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 15:34:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 15:34:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 15:34:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:34:42,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:34:42,398 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:34:42,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:34:42,432 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:34:43,048 INFO L? ?]: Removed 198 outVars from TransFormulas that were not future-live. [2024-10-11 15:34:43,048 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:34:43,139 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:34:43,140 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 15:34:43,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:34:43 BoogieIcfgContainer [2024-10-11 15:34:43,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:34:43,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:34:43,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:34:43,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:34:43,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:34:40" (1/3) ... [2024-10-11 15:34:43,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c46a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:34:43, skipping insertion in model container [2024-10-11 15:34:43,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:34:41" (2/3) ... [2024-10-11 15:34:43,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c46a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:34:43, skipping insertion in model container [2024-10-11 15:34:43,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:34:43" (3/3) ... [2024-10-11 15:34:43,148 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2024-10-11 15:34:43,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:34:43,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:34:43,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:34:43,257 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;@21b6f992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:34:43,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:34:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 110 states have (on average 1.5818181818181818) internal successors, (174), 126 states have internal predecessors, (174), 34 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 15:34:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 15:34:43,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:43,275 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:43,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:43,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1661791564, now seen corresponding path program 1 times [2024-10-11 15:34:43,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902102772] [2024-10-11 15:34:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 15:34:44,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902102772] [2024-10-11 15:34:44,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902102772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:44,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:44,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:34:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779631439] [2024-10-11 15:34:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:34:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:34:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:34:44,237 INFO L87 Difference]: Start difference. First operand has 155 states, 110 states have (on average 1.5818181818181818) internal successors, (174), 126 states have internal predecessors, (174), 34 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 15:34:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:44,457 INFO L93 Difference]: Finished difference Result 307 states and 472 transitions. [2024-10-11 15:34:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:34:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-10-11 15:34:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:44,468 INFO L225 Difference]: With dead ends: 307 [2024-10-11 15:34:44,469 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 15:34:44,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:34:44,477 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 38 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:44,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 332 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:34:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 15:34:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-11 15:34:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 113 states have internal predecessors, (160), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 15:34:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 204 transitions. [2024-10-11 15:34:44,513 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 204 transitions. Word has length 98 [2024-10-11 15:34:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:44,515 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 204 transitions. [2024-10-11 15:34:44,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 15:34:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 204 transitions. [2024-10-11 15:34:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 15:34:44,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:44,521 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:34:44,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:44,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -851264704, now seen corresponding path program 1 times [2024-10-11 15:34:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:44,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566844835] [2024-10-11 15:34:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:44,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 15:34:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566844835] [2024-10-11 15:34:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566844835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:45,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:45,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:34:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204435896] [2024-10-11 15:34:45,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:45,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:34:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:45,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:34:45,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:34:45,122 INFO L87 Difference]: Start difference. First operand 142 states and 204 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:34:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:45,372 INFO L93 Difference]: Finished difference Result 386 states and 553 transitions. [2024-10-11 15:34:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:34:45,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 98 [2024-10-11 15:34:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:45,375 INFO L225 Difference]: With dead ends: 386 [2024-10-11 15:34:45,375 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 15:34:45,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:45,376 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 175 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:45,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 593 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:34:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 15:34:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-10-11 15:34:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 200 states have (on average 1.48) internal successors, (296), 205 states have internal predecessors, (296), 37 states have call successors, (37), 17 states have call predecessors, (37), 16 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 15:34:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 364 transitions. [2024-10-11 15:34:45,403 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 364 transitions. Word has length 98 [2024-10-11 15:34:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:45,405 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 364 transitions. [2024-10-11 15:34:45,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 15:34:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 364 transitions. [2024-10-11 15:34:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 15:34:45,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:45,410 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:45,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:34:45,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:45,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1828643628, now seen corresponding path program 1 times [2024-10-11 15:34:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:45,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309573357] [2024-10-11 15:34:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:45,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 15:34:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 15:34:45,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309573357] [2024-10-11 15:34:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309573357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:45,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:34:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001121808] [2024-10-11 15:34:45,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:34:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:34:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:34:45,922 INFO L87 Difference]: Start difference. First operand 254 states and 364 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:46,104 INFO L93 Difference]: Finished difference Result 651 states and 954 transitions. [2024-10-11 15:34:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:34:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2024-10-11 15:34:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:46,107 INFO L225 Difference]: With dead ends: 651 [2024-10-11 15:34:46,107 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 15:34:46,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:46,109 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 178 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:46,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 580 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:34:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 15:34:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2024-10-11 15:34:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 336 states have (on average 1.5148809523809523) internal successors, (509), 341 states have internal predecessors, (509), 52 states have call successors, (52), 24 states have call predecessors, (52), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:34:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 607 transitions. [2024-10-11 15:34:46,137 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 607 transitions. Word has length 101 [2024-10-11 15:34:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:46,137 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 607 transitions. [2024-10-11 15:34:46,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 607 transitions. [2024-10-11 15:34:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 15:34:46,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:46,139 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:34:46,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:46,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 956562356, now seen corresponding path program 1 times [2024-10-11 15:34:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536554609] [2024-10-11 15:34:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-11 15:34:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:46,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536554609] [2024-10-11 15:34:46,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536554609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:46,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:46,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:34:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619664050] [2024-10-11 15:34:46,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:46,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:34:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:46,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:34:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:34:46,700 INFO L87 Difference]: Start difference. First operand 412 states and 607 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:46,815 INFO L93 Difference]: Finished difference Result 414 states and 608 transitions. [2024-10-11 15:34:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:34:46,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2024-10-11 15:34:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:46,818 INFO L225 Difference]: With dead ends: 414 [2024-10-11 15:34:46,818 INFO L226 Difference]: Without dead ends: 411 [2024-10-11 15:34:46,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:46,819 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 191 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:46,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 300 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:34:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-11 15:34:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2024-10-11 15:34:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 336 states have (on average 1.5119047619047619) internal successors, (508), 340 states have internal predecessors, (508), 51 states have call successors, (51), 24 states have call predecessors, (51), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:34:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 605 transitions. [2024-10-11 15:34:46,835 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 605 transitions. Word has length 115 [2024-10-11 15:34:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:46,836 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 605 transitions. [2024-10-11 15:34:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 605 transitions. [2024-10-11 15:34:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 15:34:46,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:46,837 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:34:46,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:46,838 INFO L85 PathProgramCache]: Analyzing trace with hash -411312740, now seen corresponding path program 1 times [2024-10-11 15:34:46,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:46,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029976224] [2024-10-11 15:34:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:46,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-11 15:34:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029976224] [2024-10-11 15:34:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029976224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:34:47,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144793650] [2024-10-11 15:34:47,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:34:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:34:47,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:34:47,300 INFO L87 Difference]: Start difference. First operand 411 states and 605 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:47,413 INFO L93 Difference]: Finished difference Result 413 states and 606 transitions. [2024-10-11 15:34:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:34:47,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2024-10-11 15:34:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:47,416 INFO L225 Difference]: With dead ends: 413 [2024-10-11 15:34:47,416 INFO L226 Difference]: Without dead ends: 410 [2024-10-11 15:34:47,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:47,417 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 188 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:47,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 297 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:34:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-11 15:34:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2024-10-11 15:34:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 336 states have (on average 1.5089285714285714) internal successors, (507), 339 states have internal predecessors, (507), 50 states have call successors, (50), 24 states have call predecessors, (50), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:34:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2024-10-11 15:34:47,432 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 116 [2024-10-11 15:34:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:47,433 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2024-10-11 15:34:47,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2024-10-11 15:34:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 15:34:47,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:47,434 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:47,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:34:47,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:47,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 134237111, now seen corresponding path program 1 times [2024-10-11 15:34:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873089526] [2024-10-11 15:34:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-11 15:34:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873089526] [2024-10-11 15:34:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873089526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:47,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:34:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252745773] [2024-10-11 15:34:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:47,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:34:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:34:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:34:47,922 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:48,063 INFO L93 Difference]: Finished difference Result 412 states and 604 transitions. [2024-10-11 15:34:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:34:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 117 [2024-10-11 15:34:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:48,065 INFO L225 Difference]: With dead ends: 412 [2024-10-11 15:34:48,065 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 15:34:48,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:48,066 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 170 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:48,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 426 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:34:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 15:34:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2024-10-11 15:34:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 336 states have (on average 1.505952380952381) internal successors, (506), 338 states have internal predecessors, (506), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:34:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 601 transitions. [2024-10-11 15:34:48,083 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 601 transitions. Word has length 117 [2024-10-11 15:34:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:48,084 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 601 transitions. [2024-10-11 15:34:48,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 601 transitions. [2024-10-11 15:34:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 15:34:48,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:48,085 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:48,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:34:48,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:48,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash -133581825, now seen corresponding path program 1 times [2024-10-11 15:34:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251530020] [2024-10-11 15:34:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-11 15:34:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251530020] [2024-10-11 15:34:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251530020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:48,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:48,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:34:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503187415] [2024-10-11 15:34:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:48,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:34:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:34:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:34:48,594 INFO L87 Difference]: Start difference. First operand 409 states and 601 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:48,803 INFO L93 Difference]: Finished difference Result 1165 states and 1731 transitions. [2024-10-11 15:34:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:34:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2024-10-11 15:34:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:48,808 INFO L225 Difference]: With dead ends: 1165 [2024-10-11 15:34:48,808 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 15:34:48,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:48,809 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 177 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:48,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 569 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:34:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 15:34:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 773. [2024-10-11 15:34:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 644 states have (on average 1.5124223602484472) internal successors, (974), 646 states have internal predecessors, (974), 87 states have call successors, (87), 44 states have call predecessors, (87), 41 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 15:34:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1145 transitions. [2024-10-11 15:34:48,835 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1145 transitions. Word has length 118 [2024-10-11 15:34:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:48,835 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1145 transitions. [2024-10-11 15:34:48,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 15:34:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1145 transitions. [2024-10-11 15:34:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 15:34:48,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:48,837 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2024-10-11 15:34:48,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:34:48,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:48,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2063448416, now seen corresponding path program 1 times [2024-10-11 15:34:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:48,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564784263] [2024-10-11 15:34:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:48,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 15:34:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:34:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-10-11 15:34:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564784263] [2024-10-11 15:34:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564784263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:49,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:49,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:34:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750899936] [2024-10-11 15:34:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:49,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:34:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:34:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:34:49,308 INFO L87 Difference]: Start difference. First operand 773 states and 1145 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:34:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:49,585 INFO L93 Difference]: Finished difference Result 1522 states and 2259 transitions. [2024-10-11 15:34:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:34:49,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 132 [2024-10-11 15:34:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:49,589 INFO L225 Difference]: With dead ends: 1522 [2024-10-11 15:34:49,589 INFO L226 Difference]: Without dead ends: 775 [2024-10-11 15:34:49,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 15:34:49,593 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 205 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:49,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 869 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:34:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-10-11 15:34:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 770. [2024-10-11 15:34:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 642 states have (on average 1.5077881619937694) internal successors, (968), 644 states have internal predecessors, (968), 86 states have call successors, (86), 43 states have call predecessors, (86), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-11 15:34:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1136 transitions. [2024-10-11 15:34:49,629 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1136 transitions. Word has length 132 [2024-10-11 15:34:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1136 transitions. [2024-10-11 15:34:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:34:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1136 transitions. [2024-10-11 15:34:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 15:34:49,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:49,632 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2024-10-11 15:34:49,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:34:49,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:49,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1422838943, now seen corresponding path program 1 times [2024-10-11 15:34:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793443070] [2024-10-11 15:34:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 15:34:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:34:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-11 15:34:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793443070] [2024-10-11 15:34:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793443070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:50,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:50,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 15:34:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754224819] [2024-10-11 15:34:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 15:34:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 15:34:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:34:50,301 INFO L87 Difference]: Start difference. First operand 770 states and 1136 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:34:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:50,547 INFO L93 Difference]: Finished difference Result 1516 states and 2244 transitions. [2024-10-11 15:34:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 15:34:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 136 [2024-10-11 15:34:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:50,550 INFO L225 Difference]: With dead ends: 1516 [2024-10-11 15:34:50,550 INFO L226 Difference]: Without dead ends: 772 [2024-10-11 15:34:50,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:34:50,551 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 33 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:50,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1041 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:34:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-11 15:34:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2024-10-11 15:34:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 645 states have (on average 1.5023255813953489) internal successors, (969), 646 states have internal predecessors, (969), 85 states have call successors, (85), 43 states have call predecessors, (85), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-11 15:34:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1136 transitions. [2024-10-11 15:34:50,583 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1136 transitions. Word has length 136 [2024-10-11 15:34:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:50,583 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1136 transitions. [2024-10-11 15:34:50,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 15:34:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1136 transitions. [2024-10-11 15:34:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 15:34:50,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:34:50,585 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 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] [2024-10-11 15:34:50,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:34:50,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:34:50,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:34:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash -960369287, now seen corresponding path program 1 times [2024-10-11 15:34:50,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:34:50,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894351691] [2024-10-11 15:34:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:34:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:34:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:34:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:34:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 15:34:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:34:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:34:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:34:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:34:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:34:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 15:34:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:34:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 15:34:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:34:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-11 15:34:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:34:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894351691] [2024-10-11 15:34:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894351691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:34:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:34:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:34:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318296866] [2024-10-11 15:34:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:34:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:34:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:34:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:34:51,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:34:51,167 INFO L87 Difference]: Start difference. First operand 772 states and 1136 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 15:34:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:34:51,402 INFO L93 Difference]: Finished difference Result 772 states and 1136 transitions. [2024-10-11 15:34:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:34:51,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 145 [2024-10-11 15:34:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:34:51,403 INFO L225 Difference]: With dead ends: 772 [2024-10-11 15:34:51,404 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 15:34:51,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:34:51,405 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 44 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:34:51,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 647 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:34:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 15:34:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 15:34:51,406 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:34:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 15:34:51,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2024-10-11 15:34:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:34:51,408 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 15:34:51,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 15:34:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 15:34:51,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 15:34:51,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:34:51,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:34:51,416 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:34:51,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 15:34:52,475 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 15:34:52,484 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 [2024-10-11 15:34:52,485 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 [2024-10-11 15:34:52,485 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 [2024-10-11 15:34:52,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_6~0 [2024-10-11 15:34:52,486 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 [2024-10-11 15:34:52,498 WARN L155 FloydHoareUtils]: Requires clause for ldv_mutex_lock_udev contained old-variable. Original clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= |old(~ldv_mutex_udev~0)| 1) (= ~ldv_mutex_udev~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2024-10-11 15:34:52,503 WARN L155 FloydHoareUtils]: Requires clause for ldv_init_zalloc contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1)) (.cse3 (= ~ldv_mutex_udev~0 1))) (or (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_6~0 0) .cse3) (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3))) (= |#memory_int#8| |old(#memory_int#8)|) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1)) (.cse3 (= ~ldv_mutex_udev~0 1))) (or (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_6~0 0) .cse3) (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3))) [2024-10-11 15:34:52,514 WARN L155 FloydHoareUtils]: Requires clause for #Ultimate.meminit contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1)) (.cse3 (= ~ldv_mutex_udev~0 1))) (or (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_6~0 0) .cse3) (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3))) (= |#memory_int#8| |old(#memory_int#8)|)) Eliminated clause: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1)) (.cse3 (= ~ldv_mutex_udev~0 1))) (or (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_6~0 0) .cse3) (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3))) [2024-10-11 15:34:52,516 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_6~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 [2024-10-11 15:34:52,517 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 [2024-10-11 15:34:52,518 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 [2024-10-11 15:34:52,518 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 [2024-10-11 15:34:52,518 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 [2024-10-11 15:34:52,518 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 [2024-10-11 15:34:52,519 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 [2024-10-11 15:34:52,519 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_6~0 [2024-10-11 15:34:52,519 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 [2024-10-11 15:34:52,519 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 15:34:52,520 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 [2024-10-11 15:34:52,520 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 [2024-10-11 15:34:52,520 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 [2024-10-11 15:34:52,520 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 [2024-10-11 15:34:52,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:34:52 BoogieIcfgContainer [2024-10-11 15:34:52,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 15:34:52,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 15:34:52,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 15:34:52,526 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 15:34:52,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:34:43" (3/4) ... [2024-10-11 15:34:52,528 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 15:34:52,530 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2024-10-11 15:34:52,530 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_udev [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure always_connected [2024-10-11 15:34:52,531 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int_negative [2024-10-11 15:34:52,548 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2024-10-11 15:34:52,550 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-10-11 15:34:52,551 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 15:34:52,552 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 15:34:52,553 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 15:34:52,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 15:34:52,743 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 15:34:52,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 15:34:52,744 INFO L158 Benchmark]: Toolchain (without parser) took 11930.01ms. Allocated memory was 151.0MB in the beginning and 763.4MB in the end (delta: 612.4MB). Free memory was 88.2MB in the beginning and 470.8MB in the end (delta: -382.6MB). Peak memory consumption was 229.9MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,745 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:34:52,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1067.97ms. Allocated memory was 151.0MB in the beginning and 270.5MB in the end (delta: 119.5MB). Free memory was 88.2MB in the beginning and 173.7MB in the end (delta: -85.5MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.77ms. Allocated memory is still 270.5MB. Free memory was 173.7MB in the beginning and 165.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,747 INFO L158 Benchmark]: Boogie Preprocessor took 118.88ms. Allocated memory is still 270.5MB. Free memory was 165.3MB in the beginning and 151.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,747 INFO L158 Benchmark]: RCFGBuilder took 1039.78ms. Allocated memory is still 270.5MB. Free memory was 151.7MB in the beginning and 105.9MB in the end (delta: 45.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,747 INFO L158 Benchmark]: TraceAbstraction took 9382.32ms. Allocated memory was 270.5MB in the beginning and 763.4MB in the end (delta: 492.8MB). Free memory was 105.9MB in the beginning and 506.5MB in the end (delta: -400.6MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,747 INFO L158 Benchmark]: Witness Printer took 218.05ms. Allocated memory is still 763.4MB. Free memory was 506.5MB in the beginning and 470.8MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 15:34:52,748 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1067.97ms. Allocated memory was 151.0MB in the beginning and 270.5MB in the end (delta: 119.5MB). Free memory was 88.2MB in the beginning and 173.7MB in the end (delta: -85.5MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.77ms. Allocated memory is still 270.5MB. Free memory was 173.7MB in the beginning and 165.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.88ms. Allocated memory is still 270.5MB. Free memory was 165.3MB in the beginning and 151.7MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1039.78ms. Allocated memory is still 270.5MB. Free memory was 151.7MB in the beginning and 105.9MB in the end (delta: 45.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9382.32ms. Allocated memory was 270.5MB in the beginning and 763.4MB in the end (delta: 492.8MB). Free memory was 105.9MB in the beginning and 506.5MB in the end (delta: -400.6MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * Witness Printer took 218.05ms. Allocated memory is still 763.4MB. Free memory was 506.5MB in the beginning and 470.8MB in the end (delta: 35.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_6~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_6~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_6~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_mutex_of_device~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_i_mutex_of_inode~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_lock~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_mutex_udev~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6333]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 156 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1399 mSDsluCounter, 5654 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3881 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1464 IncrementalHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 1773 mSDtfsCounter, 1464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=773occurred in iteration=7, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1166 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2327/2327 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5792]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 7015]: Procedure Contract for usbnet_disconnect Derived contract for procedure usbnet_disconnect. Requires: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) Ensures: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) - ProcedureContractResult [Line: 6329]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 6853]: Procedure Contract for ldv_mutex_lock_udev Derived contract for procedure ldv_mutex_lock_udev. Requires: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (2 == ldv_mutex_udev)) && (\old(ldv_mutex_udev) == 1)) - ProcedureContractResult [Line: 5757]: Procedure Contract for ldv_init_zalloc Derived contract for procedure ldv_init_zalloc. Requires: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_6 == 0)) && (ldv_mutex_udev == 1)) || (((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1))) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_6 == 0)) && (ldv_mutex_udev == 1)) || (((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1))) - ProcedureContractResult [Line: 5720]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_6 == 0)) && (ldv_mutex_udev == 1)) || (((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1))) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_state_variable_6 == 0)) && (ldv_mutex_udev == 1)) || (((((ldv_state_variable_0 == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1))) - ProcedureContractResult [Line: 5776]: Procedure Contract for ldv_undef_int Derived contract for procedure ldv_undef_int. Requires: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) Ensures: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) - ProcedureContractResult [Line: 5837]: Procedure Contract for always_connected Derived contract for procedure always_connected. Requires: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) Ensures: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) - ProcedureContractResult [Line: 6336]: Procedure Contract for ldv_undef_int_negative Derived contract for procedure ldv_undef_int_negative. Requires: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (ldv_mutex_udev == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_i_mutex_of_inode == 1)) && (ldv_mutex_lock == 1)) && (((long) \result + 1) <= 0)) && (ldv_mutex_udev == 1)) RESULT: Ultimate proved your program to be correct! [2024-10-11 15:34:52,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE