./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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.2-?-f4b24e3 [2022-07-14 01:29:08,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 01:29:08,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 01:29:08,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 01:29:08,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 01:29:08,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 01:29:08,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 01:29:08,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 01:29:08,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 01:29:08,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 01:29:08,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 01:29:08,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 01:29:08,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 01:29:08,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 01:29:08,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 01:29:08,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 01:29:08,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 01:29:08,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 01:29:08,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 01:29:08,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 01:29:08,201 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 01:29:08,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 01:29:08,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 01:29:08,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 01:29:08,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 01:29:08,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 01:29:08,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 01:29:08,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 01:29:08,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 01:29:08,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 01:29:08,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 01:29:08,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 01:29:08,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 01:29:08,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 01:29:08,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 01:29:08,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 01:29:08,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 01:29:08,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 01:29:08,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 01:29:08,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 01:29:08,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 01:29:08,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 01:29:08,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 01:29:08,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 01:29:08,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 01:29:08,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 01:29:08,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 01:29:08,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 01:29:08,257 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 01:29:08,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 01:29:08,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 01:29:08,258 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 01:29:08,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 01:29:08,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 01:29:08,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 01:29:08,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 01:29:08,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 01:29:08,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 01:29:08,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 01:29:08,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 01:29:08,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 01:29:08,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 01:29:08,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 01:29:08,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 01:29:08,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 01:29:08,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 01:29:08,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 01:29:08,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 01:29:08,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 01:29:08,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 01:29:08,269 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 01:29:08,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 01:29:08,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 01:29:08,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-07-14 01:29:08,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 01:29:08,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 01:29:08,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 01:29:08,554 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 01:29:08,555 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 01:29:08,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../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 [2022-07-14 01:29:08,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce03d71d7/8781f728cacc46be9a6d19bebc324608/FLAG99f3e0e1b [2022-07-14 01:29:09,193 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 01:29:09,194 INFO L160 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 [2022-07-14 01:29:09,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce03d71d7/8781f728cacc46be9a6d19bebc324608/FLAG99f3e0e1b [2022-07-14 01:29:09,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce03d71d7/8781f728cacc46be9a6d19bebc324608 [2022-07-14 01:29:09,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 01:29:09,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 01:29:09,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 01:29:09,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 01:29:09,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 01:29:09,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:29:09" (1/1) ... [2022-07-14 01:29:09,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47771bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:09, skipping insertion in model container [2022-07-14 01:29:09,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:29:09" (1/1) ... [2022-07-14 01:29:09,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 01:29:09,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 01:29:10,257 WARN L230 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] [2022-07-14 01:29:10,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 01:29:10,458 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 01:29:10,656 WARN L230 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] [2022-07-14 01:29:10,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 01:29:10,752 INFO L208 MainTranslator]: Completed translation [2022-07-14 01:29:10,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10 WrapperNode [2022-07-14 01:29:10,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 01:29:10,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 01:29:10,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 01:29:10,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 01:29:10,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,911 INFO L137 Inliner]: procedures = 117, calls = 568, calls flagged for inlining = 30, calls inlined = 25, statements flattened = 1081 [2022-07-14 01:29:10,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 01:29:10,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 01:29:10,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 01:29:10,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 01:29:10,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:10,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:11,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:11,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 01:29:11,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 01:29:11,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 01:29:11,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 01:29:11,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (1/1) ... [2022-07-14 01:29:11,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 01:29:11,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 01:29:11,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 01:29:11,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 01:29:11,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 01:29:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 01:29:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 01:29:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 01:29:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 01:29:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2022-07-14 01:29:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2022-07-14 01:29:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-07-14 01:29:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-07-14 01:29:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 01:29:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 01:29:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 01:29:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 01:29:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 01:29:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 01:29:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 01:29:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 01:29:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev [2022-07-14 01:29:11,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev [2022-07-14 01:29:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 01:29:11,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 01:29:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 01:29:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 01:29:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 01:29:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 01:29:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure always_connected [2022-07-14 01:29:11,157 INFO L138 BoogieDeclarations]: Found implementation of procedure always_connected [2022-07-14 01:29:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 01:29:11,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 01:29:11,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 01:29:11,426 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 01:29:11,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 01:29:11,506 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 01:29:12,021 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 01:29:12,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 01:29:12,032 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 01:29:12,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:29:12 BoogieIcfgContainer [2022-07-14 01:29:12,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 01:29:12,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 01:29:12,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 01:29:12,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 01:29:12,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:29:09" (1/3) ... [2022-07-14 01:29:12,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6650f48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:29:12, skipping insertion in model container [2022-07-14 01:29:12,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:29:10" (2/3) ... [2022-07-14 01:29:12,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6650f48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:29:12, skipping insertion in model container [2022-07-14 01:29:12,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:29:12" (3/3) ... [2022-07-14 01:29:12,042 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-07-14 01:29:12,052 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 01:29:12,052 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 01:29:12,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 01:29:12,144 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32b48964, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34acaf76 [2022-07-14 01:29:12,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 01:29:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 157 states have internal predecessors, (205), 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) [2022-07-14 01:29:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 01:29:12,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:12,164 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2022-07-14 01:29:12,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 665515163, now seen corresponding path program 1 times [2022-07-14 01:29:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:12,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759894331] [2022-07-14 01:29:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 01:29:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-14 01:29:12,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:12,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759894331] [2022-07-14 01:29:12,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759894331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:12,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:12,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 01:29:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131153765] [2022-07-14 01:29:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:12,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 01:29:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 01:29:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 01:29:12,960 INFO L87 Difference]: Start difference. First operand has 186 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 157 states have internal predecessors, (205), 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 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 01:29:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:13,174 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2022-07-14 01:29:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 01:29:13,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2022-07-14 01:29:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:13,191 INFO L225 Difference]: With dead ends: 367 [2022-07-14 01:29:13,191 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 01:29:13,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 01:29:13,207 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 22 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:13,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 613 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 01:29:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 01:29:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-14 01:29:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 141 states have internal predecessors, (188), 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) [2022-07-14 01:29:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2022-07-14 01:29:13,270 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 118 [2022-07-14 01:29:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:13,271 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2022-07-14 01:29:13,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 01:29:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2022-07-14 01:29:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 01:29:13,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:13,275 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2022-07-14 01:29:13,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 01:29:13,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -96288345, now seen corresponding path program 1 times [2022-07-14 01:29:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:13,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785890774] [2022-07-14 01:29:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 01:29:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-14 01:29:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785890774] [2022-07-14 01:29:13,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785890774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:13,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:13,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 01:29:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065423443] [2022-07-14 01:29:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 01:29:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:13,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 01:29:13,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 01:29:13,588 INFO L87 Difference]: Start difference. First operand 170 states and 232 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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) [2022-07-14 01:29:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:13,792 INFO L93 Difference]: Finished difference Result 435 states and 600 transitions. [2022-07-14 01:29:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 01:29:13,793 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), 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 118 [2022-07-14 01:29:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:13,797 INFO L225 Difference]: With dead ends: 435 [2022-07-14 01:29:13,797 INFO L226 Difference]: Without dead ends: 283 [2022-07-14 01:29:13,799 INFO L412 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 [2022-07-14 01:29:13,802 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 198 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:13,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 740 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 01:29:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-14 01:29:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2022-07-14 01:29:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 221 states have (on average 1.420814479638009) internal successors, (314), 226 states have internal predecessors, (314), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-14 01:29:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 376 transitions. [2022-07-14 01:29:13,832 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 376 transitions. Word has length 118 [2022-07-14 01:29:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:13,832 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 376 transitions. [2022-07-14 01:29:13,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 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) [2022-07-14 01:29:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 376 transitions. [2022-07-14 01:29:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 01:29:13,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:13,834 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1] [2022-07-14 01:29:13,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 01:29:13,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash -358901924, now seen corresponding path program 1 times [2022-07-14 01:29:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:13,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933187478] [2022-07-14 01:29:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:13,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-14 01:29:14,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:14,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933187478] [2022-07-14 01:29:14,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933187478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:14,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:14,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 01:29:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379632243] [2022-07-14 01:29:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:14,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 01:29:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 01:29:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 01:29:14,113 INFO L87 Difference]: Start difference. First operand 269 states and 376 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-14 01:29:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:14,315 INFO L93 Difference]: Finished difference Result 730 states and 1030 transitions. [2022-07-14 01:29:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 01:29:14,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 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 117 [2022-07-14 01:29:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:14,319 INFO L225 Difference]: With dead ends: 730 [2022-07-14 01:29:14,319 INFO L226 Difference]: Without dead ends: 479 [2022-07-14 01:29:14,320 INFO L412 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 [2022-07-14 01:29:14,321 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 188 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:14,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 856 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 01:29:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-07-14 01:29:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2022-07-14 01:29:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 399 states have (on average 1.4335839598997493) internal successors, (572), 404 states have internal predecessors, (572), 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) [2022-07-14 01:29:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 670 transitions. [2022-07-14 01:29:14,339 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 670 transitions. Word has length 117 [2022-07-14 01:29:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:14,340 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 670 transitions. [2022-07-14 01:29:14,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-14 01:29:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 670 transitions. [2022-07-14 01:29:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-14 01:29:14,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:14,341 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1, 1] [2022-07-14 01:29:14,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 01:29:14,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1959898998, now seen corresponding path program 1 times [2022-07-14 01:29:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:14,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093739690] [2022-07-14 01:29:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-14 01:29:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:14,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093739690] [2022-07-14 01:29:14,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093739690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:14,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 01:29:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004699690] [2022-07-14 01:29:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:14,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 01:29:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:14,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 01:29:14,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 01:29:14,685 INFO L87 Difference]: Start difference. First operand 475 states and 670 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2022-07-14 01:29:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:14,790 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2022-07-14 01:29:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 01:29:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 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 137 [2022-07-14 01:29:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:14,793 INFO L225 Difference]: With dead ends: 477 [2022-07-14 01:29:14,793 INFO L226 Difference]: Without dead ends: 474 [2022-07-14 01:29:14,793 INFO L412 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 [2022-07-14 01:29:14,794 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 198 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:14,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 559 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 01:29:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-14 01:29:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-14 01:29:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 399 states have (on average 1.431077694235589) internal successors, (571), 403 states have internal predecessors, (571), 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) [2022-07-14 01:29:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 668 transitions. [2022-07-14 01:29:14,826 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 668 transitions. Word has length 137 [2022-07-14 01:29:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:14,828 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 668 transitions. [2022-07-14 01:29:14,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 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) [2022-07-14 01:29:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2022-07-14 01:29:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 01:29:14,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:14,833 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:14,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 01:29:14,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 627340524, now seen corresponding path program 1 times [2022-07-14 01:29:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:14,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385639950] [2022-07-14 01:29:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-14 01:29:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:15,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385639950] [2022-07-14 01:29:15,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385639950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:15,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:15,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 01:29:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835932988] [2022-07-14 01:29:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:15,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 01:29:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 01:29:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 01:29:15,087 INFO L87 Difference]: Start difference. First operand 474 states and 668 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-07-14 01:29:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:15,177 INFO L93 Difference]: Finished difference Result 476 states and 669 transitions. [2022-07-14 01:29:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 01:29:15,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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 138 [2022-07-14 01:29:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:15,181 INFO L225 Difference]: With dead ends: 476 [2022-07-14 01:29:15,181 INFO L226 Difference]: Without dead ends: 473 [2022-07-14 01:29:15,182 INFO L412 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 [2022-07-14 01:29:15,182 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 215 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:15,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 390 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 01:29:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-07-14 01:29:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2022-07-14 01:29:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 402 states have internal predecessors, (570), 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) [2022-07-14 01:29:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 666 transitions. [2022-07-14 01:29:15,198 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 666 transitions. Word has length 138 [2022-07-14 01:29:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:15,199 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 666 transitions. [2022-07-14 01:29:15,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-07-14 01:29:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 666 transitions. [2022-07-14 01:29:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 01:29:15,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:15,201 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:15,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 01:29:15,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:15,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2027261639, now seen corresponding path program 1 times [2022-07-14 01:29:15,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:15,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508085855] [2022-07-14 01:29:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-14 01:29:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508085855] [2022-07-14 01:29:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508085855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:15,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:15,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 01:29:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503275848] [2022-07-14 01:29:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:15,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 01:29:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:15,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 01:29:15,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 01:29:15,460 INFO L87 Difference]: Start difference. First operand 473 states and 666 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-07-14 01:29:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:15,548 INFO L93 Difference]: Finished difference Result 475 states and 667 transitions. [2022-07-14 01:29:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 01:29:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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 139 [2022-07-14 01:29:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:15,552 INFO L225 Difference]: With dead ends: 475 [2022-07-14 01:29:15,552 INFO L226 Difference]: Without dead ends: 472 [2022-07-14 01:29:15,552 INFO L412 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 [2022-07-14 01:29:15,553 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 192 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:15,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 551 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 01:29:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-14 01:29:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-07-14 01:29:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 399 states have (on average 1.4260651629072683) internal successors, (569), 401 states have internal predecessors, (569), 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) [2022-07-14 01:29:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 664 transitions. [2022-07-14 01:29:15,567 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 664 transitions. Word has length 139 [2022-07-14 01:29:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:15,568 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 664 transitions. [2022-07-14 01:29:15,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-07-14 01:29:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 664 transitions. [2022-07-14 01:29:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-14 01:29:15,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:15,569 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:15,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 01:29:15,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1579422095, now seen corresponding path program 1 times [2022-07-14 01:29:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:15,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371692441] [2022-07-14 01:29:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-14 01:29:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:15,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371692441] [2022-07-14 01:29:15,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371692441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:15,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:15,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 01:29:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769060856] [2022-07-14 01:29:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:15,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 01:29:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:15,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 01:29:15,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 01:29:15,824 INFO L87 Difference]: Start difference. First operand 472 states and 664 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-07-14 01:29:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:16,010 INFO L93 Difference]: Finished difference Result 1334 states and 1900 transitions. [2022-07-14 01:29:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 01:29:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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 140 [2022-07-14 01:29:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:16,016 INFO L225 Difference]: With dead ends: 1334 [2022-07-14 01:29:16,016 INFO L226 Difference]: Without dead ends: 886 [2022-07-14 01:29:16,017 INFO L412 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 [2022-07-14 01:29:16,018 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 235 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:16,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 576 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 01:29:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-14 01:29:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 880. [2022-07-14 01:29:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 751 states have (on average 1.4394141145139814) internal successors, (1081), 753 states have internal predecessors, (1081), 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) [2022-07-14 01:29:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1252 transitions. [2022-07-14 01:29:16,059 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1252 transitions. Word has length 140 [2022-07-14 01:29:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:16,059 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1252 transitions. [2022-07-14 01:29:16,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-07-14 01:29:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1252 transitions. [2022-07-14 01:29:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-14 01:29:16,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:16,063 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:16,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 01:29:16,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1050241138, now seen corresponding path program 1 times [2022-07-14 01:29:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518433161] [2022-07-14 01:29:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 01:29:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 01:29:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-07-14 01:29:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:16,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518433161] [2022-07-14 01:29:16,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518433161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:16,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:16,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 01:29:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891781494] [2022-07-14 01:29:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:16,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 01:29:16,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 01:29:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 01:29:16,373 INFO L87 Difference]: Start difference. First operand 880 states and 1252 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-14 01:29:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:16,626 INFO L93 Difference]: Finished difference Result 1730 states and 2467 transitions. [2022-07-14 01:29:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 01:29:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 159 [2022-07-14 01:29:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:16,630 INFO L225 Difference]: With dead ends: 1730 [2022-07-14 01:29:16,631 INFO L226 Difference]: Without dead ends: 882 [2022-07-14 01:29:16,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-14 01:29:16,633 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 232 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:16,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1083 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 01:29:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-07-14 01:29:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 877. [2022-07-14 01:29:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 749 states have (on average 1.4352469959946594) internal successors, (1075), 751 states have internal predecessors, (1075), 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) [2022-07-14 01:29:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1243 transitions. [2022-07-14 01:29:16,663 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1243 transitions. Word has length 159 [2022-07-14 01:29:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:16,663 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1243 transitions. [2022-07-14 01:29:16,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-07-14 01:29:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1243 transitions. [2022-07-14 01:29:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-14 01:29:16,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:16,666 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:16,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 01:29:16,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash 296332059, now seen corresponding path program 1 times [2022-07-14 01:29:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:16,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022008746] [2022-07-14 01:29:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:16,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 01:29:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 01:29:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-07-14 01:29:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022008746] [2022-07-14 01:29:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022008746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:17,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:17,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 01:29:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690998522] [2022-07-14 01:29:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:17,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 01:29:17,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 01:29:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 01:29:17,037 INFO L87 Difference]: Start difference. First operand 877 states and 1243 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 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) [2022-07-14 01:29:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:17,332 INFO L93 Difference]: Finished difference Result 2355 states and 3452 transitions. [2022-07-14 01:29:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 01:29:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 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 164 [2022-07-14 01:29:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:17,338 INFO L225 Difference]: With dead ends: 2355 [2022-07-14 01:29:17,339 INFO L226 Difference]: Without dead ends: 1510 [2022-07-14 01:29:17,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-14 01:29:17,341 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 431 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:17,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 3085 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 01:29:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-07-14 01:29:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 879. [2022-07-14 01:29:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 752 states have (on average 1.4308510638297873) internal successors, (1076), 753 states have internal predecessors, (1076), 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) [2022-07-14 01:29:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1243 transitions. [2022-07-14 01:29:17,384 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1243 transitions. Word has length 164 [2022-07-14 01:29:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:17,385 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1243 transitions. [2022-07-14 01:29:17,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 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) [2022-07-14 01:29:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1243 transitions. [2022-07-14 01:29:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-14 01:29:17,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 01:29:17,387 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 01:29:17,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 01:29:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 01:29:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1563381600, now seen corresponding path program 1 times [2022-07-14 01:29:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 01:29:17,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892732240] [2022-07-14 01:29:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 01:29:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 01:29:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 01:29:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 01:29:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 01:29:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 01:29:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 01:29:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 01:29:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 01:29:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 01:29:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 01:29:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 01:29:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-14 01:29:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-14 01:29:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 01:29:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-07-14 01:29:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 01:29:17,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892732240] [2022-07-14 01:29:17,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892732240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 01:29:17,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 01:29:17,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 01:29:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710825173] [2022-07-14 01:29:17,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 01:29:17,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 01:29:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 01:29:17,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 01:29:17,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 01:29:17,652 INFO L87 Difference]: Start difference. First operand 879 states and 1243 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2022-07-14 01:29:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 01:29:17,881 INFO L93 Difference]: Finished difference Result 1190 states and 1736 transitions. [2022-07-14 01:29:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 01:29:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 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 171 [2022-07-14 01:29:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 01:29:17,882 INFO L225 Difference]: With dead ends: 1190 [2022-07-14 01:29:17,882 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 01:29:17,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-14 01:29:17,885 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 437 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 01:29:17,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1324 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 01:29:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 01:29:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 01:29:17,886 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) [2022-07-14 01:29:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 01:29:17,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2022-07-14 01:29:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 01:29:17,886 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 01:29:17,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2022-07-14 01:29:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 01:29:17,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 01:29:17,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-14 01:29:17,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 01:29:17,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-14 01:29:19,588 INFO L902 garLoopResultBuilder]: At program point usbnet_disconnectENTRY(lines 7015 7017) the Hoare annotation is: true [2022-07-14 01:29:19,588 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 7015 7017) no Hoare annotation was computed. [2022-07-14 01:29:19,588 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 7015 7017) no Hoare annotation was computed. [2022-07-14 01:29:19,588 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevFINAL(lines 6853 6863) no Hoare annotation was computed. [2022-07-14 01:29:19,588 INFO L895 garLoopResultBuilder]: At program point ldv_mutex_lock_udevENTRY(lines 6853 6863) the Hoare annotation is: (or (not (= |old(~ldv_mutex_udev~0)| 1)) (not (= ~ldv_mutex_lock~0 1)) (not (= ~ldv_mutex_i_mutex_of_inode~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,588 INFO L899 garLoopResultBuilder]: For program point L6856-1(lines 6856 6859) no Hoare annotation was computed. [2022-07-14 01:29:19,588 INFO L899 garLoopResultBuilder]: For program point L6856(lines 6856 6859) no Hoare annotation was computed. [2022-07-14 01:29:19,589 INFO L895 garLoopResultBuilder]: At program point L6857(line 6857) the Hoare annotation is: (or (not (= |old(~ldv_mutex_udev~0)| 1)) (not (= ~ldv_mutex_lock~0 1)) (not (= ~ldv_mutex_i_mutex_of_inode~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0))) [2022-07-14 01:29:19,589 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevEXIT(lines 6853 6863) no Hoare annotation was computed. [2022-07-14 01:29:19,589 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-07-14 01:29:19,589 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5757 5767) no Hoare annotation was computed. [2022-07-14 01:29:19,589 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5757 5767) no Hoare annotation was computed. [2022-07-14 01:29:19,589 INFO L895 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5757 5767) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse3 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse4 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))))) [2022-07-14 01:29:19,589 INFO L899 garLoopResultBuilder]: For program point L5764-1(line 5764) no Hoare annotation was computed. [2022-07-14 01:29:19,589 INFO L895 garLoopResultBuilder]: At program point L5762(line 5762) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse4 (not (= 1 ~ldv_mutex_mutex_of_device~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))))) [2022-07-14 01:29:19,589 INFO L902 garLoopResultBuilder]: At program point L5764(line 5764) the Hoare annotation is: true [2022-07-14 01:29:19,590 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5720 5722) the Hoare annotation is: true [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point L5721-2(lines 5720 5722) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point L5721(line 5721) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5720 5722) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 5776 5783) the Hoare annotation is: true [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 5776 5783) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 5776 5783) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6329 6335) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6329 6335) the Hoare annotation is: true [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6329 6335) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5792 5798) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5792 5798) the Hoare annotation is: true [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point L6047(lines 6047 6062) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point L6080-2(lines 6067 6122) no Hoare annotation was computed. [2022-07-14 01:29:19,590 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-07-14 01:29:19,591 INFO L899 garLoopResultBuilder]: For program point L6080(lines 6080 6085) no Hoare annotation was computed. [2022-07-14 01:29:19,591 INFO L895 garLoopResultBuilder]: At program point L7005(lines 7004 7006) the Hoare annotation is: (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)) [2022-07-14 01:29:19,591 INFO L899 garLoopResultBuilder]: For program point L6213(line 6213) no Hoare annotation was computed. [2022-07-14 01:29:19,591 INFO L895 garLoopResultBuilder]: At program point L6081(line 6081) the Hoare annotation is: (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)) [2022-07-14 01:29:19,591 INFO L899 garLoopResultBuilder]: For program point L6081-1(line 6081) no Hoare annotation was computed. [2022-07-14 01:29:19,591 INFO L899 garLoopResultBuilder]: For program point L6973(lines 6964 6982) no Hoare annotation was computed. [2022-07-14 01:29:19,591 INFO L902 garLoopResultBuilder]: At program point L6214(line 6214) the Hoare annotation is: true [2022-07-14 01:29:19,591 INFO L895 garLoopResultBuilder]: At program point L6974(line 6974) the Hoare annotation is: false [2022-07-14 01:29:19,591 INFO L899 garLoopResultBuilder]: For program point L6049(lines 6049 6059) no Hoare annotation was computed. [2022-07-14 01:29:19,592 INFO L899 garLoopResultBuilder]: For program point L6050(line 6050) no Hoare annotation was computed. [2022-07-14 01:29:19,592 INFO L899 garLoopResultBuilder]: For program point L5852(lines 5852 5855) no Hoare annotation was computed. [2022-07-14 01:29:19,592 INFO L899 garLoopResultBuilder]: For program point L6051(lines 6051 6055) no Hoare annotation was computed. [2022-07-14 01:29:19,592 INFO L895 garLoopResultBuilder]: At program point L7009(lines 7008 7010) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 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)) [2022-07-14 01:29:19,592 INFO L899 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2022-07-14 01:29:19,592 INFO L899 garLoopResultBuilder]: For program point L6052-1(line 6052) no Hoare annotation was computed. [2022-07-14 01:29:19,592 INFO L895 garLoopResultBuilder]: At program point L6052(line 6052) the Hoare annotation is: (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)) [2022-07-14 01:29:19,592 INFO L895 garLoopResultBuilder]: At program point L5953(lines 5948 5955) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 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)) [2022-07-14 01:29:19,592 INFO L902 garLoopResultBuilder]: At program point L6977(lines 6962 6983) the Hoare annotation is: true [2022-07-14 01:29:19,593 INFO L899 garLoopResultBuilder]: For program point L6185(lines 6185 6200) no Hoare annotation was computed. [2022-07-14 01:29:19,593 INFO L895 garLoopResultBuilder]: At program point L6978(line 6978) the Hoare annotation is: false [2022-07-14 01:29:19,593 INFO L899 garLoopResultBuilder]: For program point L6945-1(line 6945) no Hoare annotation was computed. [2022-07-14 01:29:19,593 INFO L895 garLoopResultBuilder]: At program point L6945(line 6945) the Hoare annotation is: (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)) [2022-07-14 01:29:19,593 INFO L895 garLoopResultBuilder]: At program point L6318(lines 6307 6320) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 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)) [2022-07-14 01:29:19,593 INFO L895 garLoopResultBuilder]: At program point L6087(line 6087) the Hoare annotation is: (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)) [2022-07-14 01:29:19,593 INFO L899 garLoopResultBuilder]: For program point L6087-1(line 6087) no Hoare annotation was computed. [2022-07-14 01:29:19,593 INFO L895 garLoopResultBuilder]: At program point L6153(lines 6002 6228) the Hoare annotation is: (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)) [2022-07-14 01:29:19,594 INFO L899 garLoopResultBuilder]: For program point L6120(line 6120) no Hoare annotation was computed. [2022-07-14 01:29:19,594 INFO L899 garLoopResultBuilder]: For program point L6946(lines 6946 6952) no Hoare annotation was computed. [2022-07-14 01:29:19,594 INFO L899 garLoopResultBuilder]: For program point L6187(lines 6187 6197) no Hoare annotation was computed. [2022-07-14 01:29:19,594 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-07-14 01:29:19,594 INFO L902 garLoopResultBuilder]: At program point L6121(line 6121) the Hoare annotation is: true [2022-07-14 01:29:19,594 INFO L899 garLoopResultBuilder]: For program point L6947-1(line 6947) no Hoare annotation was computed. [2022-07-14 01:29:19,594 INFO L895 garLoopResultBuilder]: At program point L6947(line 6947) the Hoare annotation is: (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)) [2022-07-14 01:29:19,594 INFO L895 garLoopResultBuilder]: At program point L7013(lines 7012 7014) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)) [2022-07-14 01:29:19,594 INFO L902 garLoopResultBuilder]: At program point L6221(line 6221) the Hoare annotation is: true [2022-07-14 01:29:19,595 INFO L899 garLoopResultBuilder]: For program point L6188(line 6188) no Hoare annotation was computed. [2022-07-14 01:29:19,595 INFO L895 garLoopResultBuilder]: At program point L5858(lines 5843 5860) the Hoare annotation is: (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)) [2022-07-14 01:29:19,595 INFO L899 garLoopResultBuilder]: For program point L6189(lines 6189 6193) no Hoare annotation was computed. [2022-07-14 01:29:19,595 INFO L899 garLoopResultBuilder]: For program point L6057(line 6057) no Hoare annotation was computed. [2022-07-14 01:29:19,595 INFO L895 garLoopResultBuilder]: At program point L6223(lines 6002 6228) the Hoare annotation is: (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)) [2022-07-14 01:29:19,595 INFO L895 garLoopResultBuilder]: At program point L6190(line 6190) the Hoare annotation is: (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)) [2022-07-14 01:29:19,595 INFO L902 garLoopResultBuilder]: At program point L6058(line 6058) the Hoare annotation is: true [2022-07-14 01:29:19,595 INFO L899 garLoopResultBuilder]: For program point L6190-1(line 6190) no Hoare annotation was computed. [2022-07-14 01:29:19,596 INFO L895 garLoopResultBuilder]: At program point L6950(line 6950) the Hoare annotation is: (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)) [2022-07-14 01:29:19,596 INFO L899 garLoopResultBuilder]: For program point L6917-1(lines 6917 6920) no Hoare annotation was computed. [2022-07-14 01:29:19,596 INFO L899 garLoopResultBuilder]: For program point L6950-1(line 6950) no Hoare annotation was computed. [2022-07-14 01:29:19,596 INFO L899 garLoopResultBuilder]: For program point L6917(lines 6917 6920) no Hoare annotation was computed. [2022-07-14 01:29:19,596 INFO L895 garLoopResultBuilder]: At program point L6918(line 6918) the Hoare annotation is: false [2022-07-14 01:29:19,596 INFO L895 garLoopResultBuilder]: At program point L6951(lines 6940 6954) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) .cse2 (= 2 ~ldv_mutex_udev~0)) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 1) 0) (= ~ldv_mutex_udev~0 1)))) [2022-07-14 01:29:19,596 INFO L895 garLoopResultBuilder]: At program point L5960(lines 5956 5962) the Hoare annotation is: (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)) [2022-07-14 01:29:19,596 INFO L899 garLoopResultBuilder]: For program point L6159(line 6159) no Hoare annotation was computed. [2022-07-14 01:29:19,597 INFO L899 garLoopResultBuilder]: For program point L6027(lines 6027 6222) no Hoare annotation was computed. [2022-07-14 01:29:19,597 INFO L899 garLoopResultBuilder]: For program point L6093(line 6093) no Hoare annotation was computed. [2022-07-14 01:29:19,597 INFO L895 garLoopResultBuilder]: At program point L6985(lines 6984 6986) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)) [2022-07-14 01:29:19,597 INFO L899 garLoopResultBuilder]: For program point L6127(line 6127) no Hoare annotation was computed. [2022-07-14 01:29:19,597 INFO L899 garLoopResultBuilder]: For program point L6094(lines 6094 6098) no Hoare annotation was computed. [2022-07-14 01:29:19,597 INFO L902 garLoopResultBuilder]: At program point L6160(line 6160) the Hoare annotation is: true [2022-07-14 01:29:19,597 INFO L899 garLoopResultBuilder]: For program point L6028(line 6028) no Hoare annotation was computed. [2022-07-14 01:29:19,597 INFO L895 garLoopResultBuilder]: At program point L6326(lines 6321 6328) the Hoare annotation is: (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)) [2022-07-14 01:29:19,597 INFO L902 garLoopResultBuilder]: At program point L6227(lines 5979 6229) the Hoare annotation is: true [2022-07-14 01:29:19,598 INFO L899 garLoopResultBuilder]: For program point L6128(lines 6128 6164) no Hoare annotation was computed. [2022-07-14 01:29:19,598 INFO L899 garLoopResultBuilder]: For program point L6029(lines 6029 6044) no Hoare annotation was computed. [2022-07-14 01:29:19,598 INFO L895 garLoopResultBuilder]: At program point L7020(lines 7019 7021) the Hoare annotation is: (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)) [2022-07-14 01:29:19,598 INFO L899 garLoopResultBuilder]: For program point L6195(line 6195) no Hoare annotation was computed. [2022-07-14 01:29:19,598 INFO L895 garLoopResultBuilder]: At program point L6922(lines 6914 6924) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,598 INFO L895 garLoopResultBuilder]: At program point L6988(lines 6987 6989) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,598 INFO L899 garLoopResultBuilder]: For program point L6130(lines 6130 6161) no Hoare annotation was computed. [2022-07-14 01:29:19,598 INFO L902 garLoopResultBuilder]: At program point L6196(line 6196) the Hoare annotation is: true [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6041) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6064(line 6064) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L895 garLoopResultBuilder]: At program point L6296(lines 6291 6298) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 1) 0) (= ~ldv_mutex_udev~0 1)) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) .cse2 (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)))) [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6131(line 6131) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6065(lines 6065 6125) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6132(lines 6132 6137) no Hoare annotation was computed. [2022-07-14 01:29:19,599 INFO L899 garLoopResultBuilder]: For program point L6033(lines 6033 6037) no Hoare annotation was computed. [2022-07-14 01:29:19,600 INFO L895 garLoopResultBuilder]: At program point L7024(lines 7023 7025) the Hoare annotation is: (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)) [2022-07-14 01:29:19,600 INFO L899 garLoopResultBuilder]: For program point L6166(line 6166) no Hoare annotation was computed. [2022-07-14 01:29:19,600 INFO L899 garLoopResultBuilder]: For program point L6067(lines 6067 6122) no Hoare annotation was computed. [2022-07-14 01:29:19,600 INFO L899 garLoopResultBuilder]: For program point L6100(line 6100) no Hoare annotation was computed. [2022-07-14 01:29:19,600 INFO L895 garLoopResultBuilder]: At program point L6959(lines 6955 6961) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,600 INFO L895 garLoopResultBuilder]: At program point L6992(lines 6991 6993) the Hoare annotation is: (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)) [2022-07-14 01:29:19,600 INFO L899 garLoopResultBuilder]: For program point L6167(lines 6167 6182) no Hoare annotation was computed. [2022-07-14 01:29:19,600 INFO L899 garLoopResultBuilder]: For program point L6101(lines 6101 6108) no Hoare annotation was computed. [2022-07-14 01:29:19,600 INFO L899 garLoopResultBuilder]: For program point L6068(line 6068) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L895 garLoopResultBuilder]: At program point L6003(line 6003) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,601 INFO L899 garLoopResultBuilder]: For program point L6003-1(line 6003) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L899 garLoopResultBuilder]: For program point L6069(lines 6069 6077) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L899 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L899 garLoopResultBuilder]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L899 garLoopResultBuilder]: For program point L6169(lines 6169 6179) no Hoare annotation was computed. [2022-07-14 01:29:19,601 INFO L895 garLoopResultBuilder]: At program point L7028(lines 7027 7029) the Hoare annotation is: (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)) [2022-07-14 01:29:19,601 INFO L895 garLoopResultBuilder]: At program point L5773(lines 5768 5775) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,602 INFO L899 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2022-07-14 01:29:19,602 INFO L899 garLoopResultBuilder]: For program point L6170(line 6170) no Hoare annotation was computed. [2022-07-14 01:29:19,602 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6075) no Hoare annotation was computed. [2022-07-14 01:29:19,602 INFO L895 garLoopResultBuilder]: At program point L6005(line 6005) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,602 INFO L899 garLoopResultBuilder]: For program point L6005-1(line 6005) no Hoare annotation was computed. [2022-07-14 01:29:19,602 INFO L899 garLoopResultBuilder]: For program point L6171(lines 6171 6175) no Hoare annotation was computed. [2022-07-14 01:29:19,602 INFO L899 garLoopResultBuilder]: For program point L6039(line 6039) no Hoare annotation was computed. [2022-07-14 01:29:19,602 INFO L895 garLoopResultBuilder]: At program point L6304(lines 6299 6306) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,603 INFO L899 garLoopResultBuilder]: For program point L6139(line 6139) no Hoare annotation was computed. [2022-07-14 01:29:19,603 INFO L899 garLoopResultBuilder]: For program point L6172-1(line 6172) no Hoare annotation was computed. [2022-07-14 01:29:19,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,603 INFO L899 garLoopResultBuilder]: For program point L6205(lines 6205 6215) no Hoare annotation was computed. [2022-07-14 01:29:19,603 INFO L895 garLoopResultBuilder]: At program point L6172(line 6172) the Hoare annotation is: (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)) [2022-07-14 01:29:19,603 INFO L895 garLoopResultBuilder]: At program point L6007(line 6007) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,603 INFO L899 garLoopResultBuilder]: For program point L6007-1(line 6007) no Hoare annotation was computed. [2022-07-14 01:29:19,603 INFO L895 garLoopResultBuilder]: At program point L5974(line 5974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 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)) [2022-07-14 01:29:19,604 INFO L902 garLoopResultBuilder]: At program point L6040(line 6040) the Hoare annotation is: true [2022-07-14 01:29:19,604 INFO L899 garLoopResultBuilder]: For program point L5974-1(line 5974) no Hoare annotation was computed. [2022-07-14 01:29:19,604 INFO L899 garLoopResultBuilder]: For program point L6965-1(lines 6964 6982) no Hoare annotation was computed. [2022-07-14 01:29:19,604 INFO L899 garLoopResultBuilder]: For program point L6965(lines 6965 6968) no Hoare annotation was computed. [2022-07-14 01:29:19,604 INFO L899 garLoopResultBuilder]: For program point L6206(line 6206) no Hoare annotation was computed. [2022-07-14 01:29:19,604 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6157) no Hoare annotation was computed. [2022-07-14 01:29:19,604 INFO L895 garLoopResultBuilder]: At program point L6966(line 6966) the Hoare annotation is: false [2022-07-14 01:29:19,604 INFO L899 garLoopResultBuilder]: For program point L6207(lines 6207 6211) no Hoare annotation was computed. [2022-07-14 01:29:19,604 INFO L895 garLoopResultBuilder]: At program point L6009(line 6009) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,605 INFO L899 garLoopResultBuilder]: For program point L6009-1(line 6009) no Hoare annotation was computed. [2022-07-14 01:29:19,605 INFO L895 garLoopResultBuilder]: At program point L5976(lines 5970 5978) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 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)) [2022-07-14 01:29:19,605 INFO L899 garLoopResultBuilder]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2022-07-14 01:29:19,605 INFO L899 garLoopResultBuilder]: For program point L6142(lines 6142 6150) no Hoare annotation was computed. [2022-07-14 01:29:19,605 INFO L895 garLoopResultBuilder]: At program point L6208(line 6208) the Hoare annotation is: (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)) [2022-07-14 01:29:19,605 INFO L899 garLoopResultBuilder]: For program point L6142-2(lines 6140 6156) no Hoare annotation was computed. [2022-07-14 01:29:19,605 INFO L899 garLoopResultBuilder]: For program point L6110(line 6110) no Hoare annotation was computed. [2022-07-14 01:29:19,605 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,605 INFO L895 garLoopResultBuilder]: At program point L6011(line 6011) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,606 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,606 INFO L899 garLoopResultBuilder]: For program point L6011-1(line 6011) no Hoare annotation was computed. [2022-07-14 01:29:19,606 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,606 INFO L899 garLoopResultBuilder]: For program point L6969(lines 6964 6982) no Hoare annotation was computed. [2022-07-14 01:29:19,606 INFO L899 garLoopResultBuilder]: For program point L6111(lines 6111 6118) no Hoare annotation was computed. [2022-07-14 01:29:19,606 INFO L899 garLoopResultBuilder]: For program point L6177(line 6177) no Hoare annotation was computed. [2022-07-14 01:29:19,606 INFO L895 garLoopResultBuilder]: At program point L6970(line 6970) the Hoare annotation is: false [2022-07-14 01:29:19,606 INFO L902 garLoopResultBuilder]: At program point L6178(line 6178) the Hoare annotation is: true [2022-07-14 01:29:19,606 INFO L899 garLoopResultBuilder]: For program point L6079(line 6079) no Hoare annotation was computed. [2022-07-14 01:29:19,607 INFO L899 garLoopResultBuilder]: For program point L6046(line 6046) no Hoare annotation was computed. [2022-07-14 01:29:19,607 INFO L895 garLoopResultBuilder]: At program point L6013(line 6013) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-07-14 01:29:19,607 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-07-14 01:29:19,607 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse4 (not (= 1 ~ldv_mutex_mutex_of_device~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))))) [2022-07-14 01:29:19,607 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,607 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-07-14 01:29:19,607 INFO L902 garLoopResultBuilder]: At program point always_connectedENTRY(lines 5837 5842) the Hoare annotation is: true [2022-07-14 01:29:19,607 INFO L899 garLoopResultBuilder]: For program point always_connectedFINAL(lines 5837 5842) no Hoare annotation was computed. [2022-07-14 01:29:19,607 INFO L899 garLoopResultBuilder]: For program point always_connectedEXIT(lines 5837 5842) no Hoare annotation was computed. [2022-07-14 01:29:19,608 INFO L902 garLoopResultBuilder]: At program point ldv_undef_int_negativeENTRY(lines 6336 6349) the Hoare annotation is: true [2022-07-14 01:29:19,608 INFO L899 garLoopResultBuilder]: For program point L6343-1(lines 6343 6346) no Hoare annotation was computed. [2022-07-14 01:29:19,608 INFO L899 garLoopResultBuilder]: For program point L6343(lines 6343 6346) no Hoare annotation was computed. [2022-07-14 01:29:19,608 INFO L902 garLoopResultBuilder]: At program point L6344(line 6344) the Hoare annotation is: true [2022-07-14 01:29:19,608 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeFINAL(lines 6336 6349) no Hoare annotation was computed. [2022-07-14 01:29:19,608 INFO L899 garLoopResultBuilder]: For program point L6341-1(line 6341) no Hoare annotation was computed. [2022-07-14 01:29:19,608 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeEXIT(lines 6336 6349) no Hoare annotation was computed. [2022-07-14 01:29:19,608 INFO L902 garLoopResultBuilder]: At program point L6341(line 6341) the Hoare annotation is: true [2022-07-14 01:29:19,611 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 01:29:19,612 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 01:29:19,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:29:19 BoogieIcfgContainer [2022-07-14 01:29:19,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 01:29:19,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 01:29:19,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 01:29:19,647 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 01:29:19,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:29:12" (3/4) ... [2022-07-14 01:29:19,659 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 01:29:19,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-07-14 01:29:19,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-14 01:29:19,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_udev [2022-07-14 01:29:19,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-14 01:29:19,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-07-14 01:29:19,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-14 01:29:19,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-07-14 01:29:19,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-07-14 01:29:19,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure always_connected [2022-07-14 01:29:19,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int_negative [2022-07-14 01:29:19,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-07-14 01:29:19,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-14 01:29:19,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-14 01:29:19,686 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-14 01:29:19,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 01:29:19,719 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-07-14 01:29:19,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-07-14 01:29:19,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ldv_mutex_udev == 1) [2022-07-14 01:29:19,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-07-14 01:29:19,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) [2022-07-14 01:29:19,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 [2022-07-14 01:29:19,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 [2022-07-14 01:29:19,867 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 01:29:19,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 01:29:19,868 INFO L158 Benchmark]: Toolchain (without parser) took 10437.54ms. Allocated memory was 136.3MB in the beginning and 463.5MB in the end (delta: 327.2MB). Free memory was 98.2MB in the beginning and 225.5MB in the end (delta: -127.3MB). Peak memory consumption was 198.7MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,868 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 90.2MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 01:29:19,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1323.28ms. Allocated memory was 136.3MB in the beginning and 255.9MB in the end (delta: 119.5MB). Free memory was 98.0MB in the beginning and 189.0MB in the end (delta: -91.0MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.43ms. Allocated memory is still 255.9MB. Free memory was 189.0MB in the beginning and 180.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,869 INFO L158 Benchmark]: Boogie Preprocessor took 110.32ms. Allocated memory is still 255.9MB. Free memory was 180.6MB in the beginning and 171.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,869 INFO L158 Benchmark]: RCFGBuilder took 1010.64ms. Allocated memory is still 255.9MB. Free memory was 171.2MB in the beginning and 114.6MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,870 INFO L158 Benchmark]: TraceAbstraction took 7610.18ms. Allocated memory was 255.9MB in the beginning and 463.5MB in the end (delta: 207.6MB). Free memory was 113.6MB in the beginning and 256.9MB in the end (delta: -143.3MB). Peak memory consumption was 189.0MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,870 INFO L158 Benchmark]: Witness Printer took 220.55ms. Allocated memory is still 463.5MB. Free memory was 256.9MB in the beginning and 225.5MB in the end (delta: 31.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-14 01:29:19,871 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 90.2MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1323.28ms. Allocated memory was 136.3MB in the beginning and 255.9MB in the end (delta: 119.5MB). Free memory was 98.0MB in the beginning and 189.0MB in the end (delta: -91.0MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.43ms. Allocated memory is still 255.9MB. Free memory was 189.0MB in the beginning and 180.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.32ms. Allocated memory is still 255.9MB. Free memory was 180.6MB in the beginning and 171.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.64ms. Allocated memory is still 255.9MB. Free memory was 171.2MB in the beginning and 114.6MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7610.18ms. Allocated memory was 255.9MB in the beginning and 463.5MB in the end (delta: 207.6MB). Free memory was 113.6MB in the beginning and 256.9MB in the end (delta: -143.3MB). Peak memory consumption was 189.0MB. Max. memory is 16.1GB. * Witness Printer took 220.55ms. Allocated memory is still 463.5MB. Free memory was 256.9MB in the beginning and 225.5MB in the end (delta: 31.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2427 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2348 mSDsluCounter, 9777 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6892 mSDsCounter, 519 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1132 IncrementalHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 519 mSolverCounterUnsat, 2885 mSDtfsCounter, 1132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=880occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 660 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 567 PreInvPairs, 725 NumberOfFragments, 882 HoareAnnotationTreeSize, 567 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 70 FomulaSimplificationsInter, 7028 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 2506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2713/2713 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: 7008]: Loop Invariant Derived loop invariant: (((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 - InvariantResult [Line: 7019]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7027]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5970]: Loop Invariant Derived loop invariant: (((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 - InvariantResult [Line: 6914]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6299]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6955]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5956]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6987]: Loop Invariant Derived loop invariant: (((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 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5979]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ldv_mutex_udev == 1) - InvariantResult [Line: 6984]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 - InvariantResult [Line: 7023]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7004]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5843]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6321]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5768]: Loop Invariant Derived loop invariant: (((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 - InvariantResult [Line: 6962]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6307]: Loop Invariant Derived loop invariant: (((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 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((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 - InvariantResult [Line: 6291]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) - InvariantResult [Line: 6991]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7012]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 - InvariantResult [Line: 5948]: Loop Invariant Derived loop invariant: (((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 RESULT: Ultimate proved your program to be correct! [2022-07-14 01:29:19,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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