./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 35987657 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-?-3598765 [2022-07-21 12:21:50,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 12:21:50,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 12:21:50,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 12:21:50,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 12:21:50,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 12:21:50,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 12:21:50,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 12:21:50,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 12:21:50,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 12:21:50,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 12:21:50,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 12:21:50,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 12:21:50,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 12:21:50,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 12:21:50,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 12:21:50,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 12:21:50,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 12:21:50,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 12:21:50,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 12:21:50,675 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 12:21:50,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 12:21:50,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 12:21:50,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 12:21:50,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 12:21:50,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 12:21:50,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 12:21:50,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 12:21:50,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 12:21:50,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 12:21:50,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 12:21:50,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 12:21:50,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 12:21:50,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 12:21:50,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 12:21:50,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 12:21:50,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 12:21:50,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 12:21:50,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 12:21:50,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 12:21:50,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 12:21:50,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 12:21:50,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 12:21:50,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 12:21:50,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 12:21:50,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 12:21:50,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 12:21:50,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 12:21:50,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 12:21:50,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 12:21:50,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 12:21:50,729 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 12:21:50,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 12:21:50,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 12:21:50,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 12:21:50,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 12:21:50,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 12:21:50,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 12:21:50,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 12:21:50,741 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 12:21:50,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 12:21:50,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 12:21:50,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 12:21:50,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 12:21:50,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 12:21:50,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 12:21:50,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 12:21:50,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 12:21:50,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 12:21:50,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 12:21:50,742 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 12:21:50,743 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 12:21:50,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 12:21:50,743 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-21 12:21:51,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 12:21:51,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 12:21:51,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 12:21:51,055 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 12:21:51,056 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 12:21:51,057 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-21 12:21:51,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8030ef143/0d85ed064a634fd7926079c609d6e0e3/FLAG10995e4c2 [2022-07-21 12:21:51,776 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 12:21:51,776 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-21 12:21:51,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8030ef143/0d85ed064a634fd7926079c609d6e0e3/FLAG10995e4c2 [2022-07-21 12:21:52,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8030ef143/0d85ed064a634fd7926079c609d6e0e3 [2022-07-21 12:21:52,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 12:21:52,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 12:21:52,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 12:21:52,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 12:21:52,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 12:21:52,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:21:52" (1/1) ... [2022-07-21 12:21:52,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f94fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:52, skipping insertion in model container [2022-07-21 12:21:52,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:21:52" (1/1) ... [2022-07-21 12:21:52,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 12:21:52,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 12:21:52,768 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-21 12:21:52,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 12:21:52,963 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 12:21:53,138 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-21 12:21:53,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 12:21:53,227 INFO L208 MainTranslator]: Completed translation [2022-07-21 12:21:53,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53 WrapperNode [2022-07-21 12:21:53,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 12:21:53,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 12:21:53,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 12:21:53,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 12:21:53,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,350 INFO L137 Inliner]: procedures = 117, calls = 568, calls flagged for inlining = 30, calls inlined = 25, statements flattened = 1081 [2022-07-21 12:21:53,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 12:21:53,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 12:21:53,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 12:21:53,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 12:21:53,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 12:21:53,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 12:21:53,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 12:21:53,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 12:21:53,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (1/1) ... [2022-07-21 12:21:53,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 12:21:53,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 12:21:53,539 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-21 12:21:53,552 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-21 12:21:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 12:21:53,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 12:21:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 12:21:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 12:21:53,576 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 12:21:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2022-07-21 12:21:53,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2022-07-21 12:21:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-07-21 12:21:53,577 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-07-21 12:21:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 12:21:53,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 12:21:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 12:21:53,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 12:21:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 12:21:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 12:21:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 12:21:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 12:21:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev [2022-07-21 12:21:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev [2022-07-21 12:21:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 12:21:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure always_connected [2022-07-21 12:21:53,579 INFO L138 BoogieDeclarations]: Found implementation of procedure always_connected [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 12:21:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 12:21:53,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 12:21:53,790 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 12:21:53,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 12:21:53,893 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 12:21:54,518 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 12:21:54,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 12:21:54,526 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 12:21:54,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:21:54 BoogieIcfgContainer [2022-07-21 12:21:54,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 12:21:54,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 12:21:54,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 12:21:54,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 12:21:54,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:21:52" (1/3) ... [2022-07-21 12:21:54,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9022bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:21:54, skipping insertion in model container [2022-07-21 12:21:54,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:21:53" (2/3) ... [2022-07-21 12:21:54,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9022bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:21:54, skipping insertion in model container [2022-07-21 12:21:54,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:21:54" (3/3) ... [2022-07-21 12:21:54,535 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-21 12:21:54,545 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 12:21:54,546 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 12:21:54,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 12:21:54,607 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@4fecfd76, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@164c6fc [2022-07-21 12:21:54,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 12:21:54,610 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-21 12:21:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 12:21:54,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:54,621 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-21 12:21:54,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 665515163, now seen corresponding path program 1 times [2022-07-21 12:21:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:54,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036691177] [2022-07-21 12:21:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 12:21:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,377 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-21 12:21:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036691177] [2022-07-21 12:21:55,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036691177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:55,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:55,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 12:21:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720099851] [2022-07-21 12:21:55,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:55,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 12:21:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 12:21:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 12:21:55,416 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-21 12:21:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:55,620 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2022-07-21 12:21:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 12:21:55,622 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-21 12:21:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:55,629 INFO L225 Difference]: With dead ends: 367 [2022-07-21 12:21:55,629 INFO L226 Difference]: Without dead ends: 170 [2022-07-21 12:21:55,632 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-21 12:21:55,634 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.1s IncrementalHoareTripleChecker+Time [2022-07-21 12:21:55,635 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.1s Time] [2022-07-21 12:21:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-21 12:21:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-21 12:21:55,667 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-21 12:21:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2022-07-21 12:21:55,670 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 118 [2022-07-21 12:21:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:55,670 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2022-07-21 12:21:55,670 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-21 12:21:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2022-07-21 12:21:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 12:21:55,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:55,675 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-21 12:21:55,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 12:21:55,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash -96288345, now seen corresponding path program 1 times [2022-07-21 12:21:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:55,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211686448] [2022-07-21 12:21:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 12:21:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:55,940 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-21 12:21:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:55,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211686448] [2022-07-21 12:21:55,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211686448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:55,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:55,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 12:21:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428423404] [2022-07-21 12:21:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 12:21:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:55,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 12:21:55,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:21:55,944 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-21 12:21:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:56,119 INFO L93 Difference]: Finished difference Result 435 states and 600 transitions. [2022-07-21 12:21:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 12:21:56,120 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-21 12:21:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:56,123 INFO L225 Difference]: With dead ends: 435 [2022-07-21 12:21:56,123 INFO L226 Difference]: Without dead ends: 283 [2022-07-21 12:21:56,124 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-21 12:21:56,124 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-21 12:21:56,125 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-21 12:21:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-21 12:21:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2022-07-21 12:21:56,139 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-21 12:21:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 376 transitions. [2022-07-21 12:21:56,140 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 376 transitions. Word has length 118 [2022-07-21 12:21:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:56,141 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 376 transitions. [2022-07-21 12:21:56,141 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-21 12:21:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 376 transitions. [2022-07-21 12:21:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 12:21:56,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:56,156 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-21 12:21:56,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 12:21:56,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash -358901924, now seen corresponding path program 1 times [2022-07-21 12:21:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:56,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741180420] [2022-07-21 12:21:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,439 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-21 12:21:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:56,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741180420] [2022-07-21 12:21:56,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741180420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:56,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:56,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 12:21:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592771401] [2022-07-21 12:21:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:56,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 12:21:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 12:21:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:21:56,442 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-21 12:21:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:56,670 INFO L93 Difference]: Finished difference Result 730 states and 1030 transitions. [2022-07-21 12:21:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 12:21:56,670 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-21 12:21:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:56,674 INFO L225 Difference]: With dead ends: 730 [2022-07-21 12:21:56,675 INFO L226 Difference]: Without dead ends: 479 [2022-07-21 12:21:56,678 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-21 12:21:56,679 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 188 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-21 12:21:56,679 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-21 12:21:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-07-21 12:21:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2022-07-21 12:21:56,696 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-21 12:21:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 670 transitions. [2022-07-21 12:21:56,698 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 670 transitions. Word has length 117 [2022-07-21 12:21:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:56,699 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 670 transitions. [2022-07-21 12:21:56,699 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-21 12:21:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 670 transitions. [2022-07-21 12:21:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-21 12:21:56,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:56,701 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-21 12:21:56,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 12:21:56,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:56,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1959898998, now seen corresponding path program 1 times [2022-07-21 12:21:56,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:56,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512071983] [2022-07-21 12:21:56,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:56,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,024 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-21 12:21:57,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512071983] [2022-07-21 12:21:57,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512071983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:57,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:57,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 12:21:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137490096] [2022-07-21 12:21:57,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:57,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 12:21:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 12:21:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:21:57,026 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-21 12:21:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:57,144 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2022-07-21 12:21:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 12:21:57,145 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-21 12:21:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:57,148 INFO L225 Difference]: With dead ends: 477 [2022-07-21 12:21:57,149 INFO L226 Difference]: Without dead ends: 474 [2022-07-21 12:21:57,150 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-21 12:21:57,152 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-21 12:21:57,154 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-21 12:21:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-21 12:21:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-21 12:21:57,180 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-21 12:21:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 668 transitions. [2022-07-21 12:21:57,183 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 668 transitions. Word has length 137 [2022-07-21 12:21:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:57,187 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 668 transitions. [2022-07-21 12:21:57,187 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-21 12:21:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2022-07-21 12:21:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 12:21:57,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:57,192 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-21 12:21:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 12:21:57,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 627340524, now seen corresponding path program 1 times [2022-07-21 12:21:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547867505] [2022-07-21 12:21:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,446 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-21 12:21:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:57,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547867505] [2022-07-21 12:21:57,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547867505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:57,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:57,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 12:21:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493126044] [2022-07-21 12:21:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 12:21:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 12:21:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:21:57,450 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-21 12:21:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:57,540 INFO L93 Difference]: Finished difference Result 476 states and 669 transitions. [2022-07-21 12:21:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 12:21:57,541 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-21 12:21:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:57,544 INFO L225 Difference]: With dead ends: 476 [2022-07-21 12:21:57,545 INFO L226 Difference]: Without dead ends: 473 [2022-07-21 12:21:57,545 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-21 12:21:57,546 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-21 12:21:57,546 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-21 12:21:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-07-21 12:21:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2022-07-21 12:21:57,560 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-21 12:21:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 666 transitions. [2022-07-21 12:21:57,563 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 666 transitions. Word has length 138 [2022-07-21 12:21:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:57,564 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 666 transitions. [2022-07-21 12:21:57,564 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-21 12:21:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 666 transitions. [2022-07-21 12:21:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 12:21:57,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:57,566 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-21 12:21:57,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 12:21:57,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:57,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2027261639, now seen corresponding path program 1 times [2022-07-21 12:21:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:57,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724140410] [2022-07-21 12:21:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:57,800 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-21 12:21:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:57,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724140410] [2022-07-21 12:21:57,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724140410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:57,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:57,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 12:21:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763245192] [2022-07-21 12:21:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:57,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 12:21:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 12:21:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:21:57,801 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-21 12:21:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:57,905 INFO L93 Difference]: Finished difference Result 475 states and 667 transitions. [2022-07-21 12:21:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 12:21:57,905 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-21 12:21:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:57,907 INFO L225 Difference]: With dead ends: 475 [2022-07-21 12:21:57,907 INFO L226 Difference]: Without dead ends: 472 [2022-07-21 12:21:57,908 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-21 12:21:57,908 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-21 12:21:57,908 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-21 12:21:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-21 12:21:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-07-21 12:21:57,919 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-21 12:21:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 664 transitions. [2022-07-21 12:21:57,921 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 664 transitions. Word has length 139 [2022-07-21 12:21:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:57,922 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 664 transitions. [2022-07-21 12:21:57,922 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-21 12:21:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 664 transitions. [2022-07-21 12:21:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-21 12:21:57,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:57,923 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-21 12:21:57,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 12:21:57,923 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1579422095, now seen corresponding path program 1 times [2022-07-21 12:21:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:57,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461242501] [2022-07-21 12:21:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,164 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-21 12:21:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:58,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461242501] [2022-07-21 12:21:58,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461242501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:58,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:58,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 12:21:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771809159] [2022-07-21 12:21:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:58,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 12:21:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 12:21:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 12:21:58,167 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-21 12:21:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:58,317 INFO L93 Difference]: Finished difference Result 1334 states and 1900 transitions. [2022-07-21 12:21:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 12:21:58,318 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-21 12:21:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:58,323 INFO L225 Difference]: With dead ends: 1334 [2022-07-21 12:21:58,323 INFO L226 Difference]: Without dead ends: 886 [2022-07-21 12:21:58,324 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-21 12:21:58,325 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-21 12:21:58,326 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-21 12:21:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-07-21 12:21:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 880. [2022-07-21 12:21:58,352 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-21 12:21:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1252 transitions. [2022-07-21 12:21:58,356 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1252 transitions. Word has length 140 [2022-07-21 12:21:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:58,357 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1252 transitions. [2022-07-21 12:21:58,357 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-21 12:21:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1252 transitions. [2022-07-21 12:21:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 12:21:58,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:58,359 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-21 12:21:58,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 12:21:58,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1050241138, now seen corresponding path program 1 times [2022-07-21 12:21:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731568563] [2022-07-21 12:21:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 12:21:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 12:21:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:58,641 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-21 12:21:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:58,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731568563] [2022-07-21 12:21:58,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731568563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:58,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:58,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 12:21:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185807617] [2022-07-21 12:21:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 12:21:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 12:21:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 12:21:58,644 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-21 12:21:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:58,897 INFO L93 Difference]: Finished difference Result 1730 states and 2467 transitions. [2022-07-21 12:21:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 12:21:58,897 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-21 12:21:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:58,901 INFO L225 Difference]: With dead ends: 1730 [2022-07-21 12:21:58,901 INFO L226 Difference]: Without dead ends: 882 [2022-07-21 12:21:58,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-21 12:21:58,903 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-21 12:21:58,903 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-21 12:21:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-07-21 12:21:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 877. [2022-07-21 12:21:58,926 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-21 12:21:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1243 transitions. [2022-07-21 12:21:58,929 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1243 transitions. Word has length 159 [2022-07-21 12:21:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:58,929 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1243 transitions. [2022-07-21 12:21:58,930 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-21 12:21:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1243 transitions. [2022-07-21 12:21:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 12:21:58,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:58,932 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-21 12:21:58,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 12:21:58,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 296332059, now seen corresponding path program 1 times [2022-07-21 12:21:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:58,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2219072] [2022-07-21 12:21:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 12:21:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 12:21:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,211 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-21 12:21:59,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:59,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2219072] [2022-07-21 12:21:59,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2219072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:59,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:59,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 12:21:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322901677] [2022-07-21 12:21:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:59,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 12:21:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 12:21:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 12:21:59,214 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-21 12:21:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:21:59,548 INFO L93 Difference]: Finished difference Result 2355 states and 3452 transitions. [2022-07-21 12:21:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 12:21:59,549 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-21 12:21:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:21:59,554 INFO L225 Difference]: With dead ends: 2355 [2022-07-21 12:21:59,554 INFO L226 Difference]: Without dead ends: 1510 [2022-07-21 12:21:59,555 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-21 12:21:59,556 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-21 12:21:59,556 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-21 12:21:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-07-21 12:21:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 879. [2022-07-21 12:21:59,588 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-21 12:21:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1243 transitions. [2022-07-21 12:21:59,591 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1243 transitions. Word has length 164 [2022-07-21 12:21:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:21:59,595 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1243 transitions. [2022-07-21 12:21:59,596 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-21 12:21:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1243 transitions. [2022-07-21 12:21:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 12:21:59,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 12:21:59,598 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-21 12:21:59,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 12:21:59,598 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 12:21:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 12:21:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1563381600, now seen corresponding path program 1 times [2022-07-21 12:21:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 12:21:59,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452565108] [2022-07-21 12:21:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 12:21:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 12:21:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 12:21:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 12:21:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 12:21:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 12:21:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 12:21:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 12:21:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 12:21:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 12:21:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 12:21:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 12:21:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 12:21:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 12:21:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 12:21:59,833 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-21 12:21:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 12:21:59,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452565108] [2022-07-21 12:21:59,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452565108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 12:21:59,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 12:21:59,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 12:21:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407679594] [2022-07-21 12:21:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 12:21:59,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 12:21:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 12:21:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 12:21:59,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 12:21:59,835 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-21 12:22:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 12:22:00,073 INFO L93 Difference]: Finished difference Result 1190 states and 1736 transitions. [2022-07-21 12:22:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 12:22:00,074 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-21 12:22:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 12:22:00,074 INFO L225 Difference]: With dead ends: 1190 [2022-07-21 12:22:00,074 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 12:22:00,076 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-21 12:22:00,076 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 437 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-21 12:22:00,077 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-21 12:22:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 12:22:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 12:22:00,078 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-21 12:22:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 12:22:00,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2022-07-21 12:22:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 12:22:00,079 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 12:22:00,079 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-21 12:22:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 12:22:00,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 12:22:00,081 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 12:22:00,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 12:22:00,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 12:22:01,661 INFO L902 garLoopResultBuilder]: At program point usbnet_disconnectENTRY(lines 7015 7017) the Hoare annotation is: true [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 7015 7017) no Hoare annotation was computed. [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 7015 7017) no Hoare annotation was computed. [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevFINAL(lines 6853 6863) no Hoare annotation was computed. [2022-07-21 12:22:01,662 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-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point L6856-1(lines 6856 6859) no Hoare annotation was computed. [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point L6856(lines 6856 6859) no Hoare annotation was computed. [2022-07-21 12:22:01,662 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-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevEXIT(lines 6853 6863) no Hoare annotation was computed. [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5757 5767) no Hoare annotation was computed. [2022-07-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5757 5767) no Hoare annotation was computed. [2022-07-21 12:22:01,662 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-21 12:22:01,662 INFO L899 garLoopResultBuilder]: For program point L5764-1(line 5764) no Hoare annotation was computed. [2022-07-21 12:22:01,662 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-21 12:22:01,663 INFO L902 garLoopResultBuilder]: At program point L5764(line 5764) the Hoare annotation is: true [2022-07-21 12:22:01,663 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5720 5722) the Hoare annotation is: true [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point L5721-2(lines 5720 5722) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point L5721(line 5721) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5720 5722) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 5776 5783) the Hoare annotation is: true [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 5776 5783) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 5776 5783) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6329 6335) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6329 6335) the Hoare annotation is: true [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6329 6335) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5792 5798) no Hoare annotation was computed. [2022-07-21 12:22:01,663 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5792 5798) the Hoare annotation is: true [2022-07-21 12:22:01,665 INFO L899 garLoopResultBuilder]: For program point L6047(lines 6047 6062) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6080-2(lines 6067 6122) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6080(lines 6080 6085) no Hoare annotation was computed. [2022-07-21 12:22:01,666 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-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6213(line 6213) no Hoare annotation was computed. [2022-07-21 12:22:01,666 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-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6081-1(line 6081) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6973(lines 6964 6982) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L902 garLoopResultBuilder]: At program point L6214(line 6214) the Hoare annotation is: true [2022-07-21 12:22:01,666 INFO L895 garLoopResultBuilder]: At program point L6974(line 6974) the Hoare annotation is: false [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6049(lines 6049 6059) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6050(line 6050) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L5852(lines 5852 5855) no Hoare annotation was computed. [2022-07-21 12:22:01,666 INFO L899 garLoopResultBuilder]: For program point L6051(lines 6051 6055) no Hoare annotation was computed. [2022-07-21 12:22:01,666 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-21 12:22:01,671 INFO L899 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2022-07-21 12:22:01,672 INFO L899 garLoopResultBuilder]: For program point L6052-1(line 6052) no Hoare annotation was computed. [2022-07-21 12:22:01,672 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-21 12:22:01,672 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-21 12:22:01,672 INFO L902 garLoopResultBuilder]: At program point L6977(lines 6962 6983) the Hoare annotation is: true [2022-07-21 12:22:01,672 INFO L899 garLoopResultBuilder]: For program point L6185(lines 6185 6200) no Hoare annotation was computed. [2022-07-21 12:22:01,672 INFO L895 garLoopResultBuilder]: At program point L6978(line 6978) the Hoare annotation is: false [2022-07-21 12:22:01,672 INFO L899 garLoopResultBuilder]: For program point L6945-1(line 6945) no Hoare annotation was computed. [2022-07-21 12:22:01,672 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-21 12:22:01,672 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-21 12:22:01,672 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-21 12:22:01,672 INFO L899 garLoopResultBuilder]: For program point L6087-1(line 6087) no Hoare annotation was computed. [2022-07-21 12:22:01,672 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-21 12:22:01,672 INFO L899 garLoopResultBuilder]: For program point L6120(line 6120) no Hoare annotation was computed. [2022-07-21 12:22:01,672 INFO L899 garLoopResultBuilder]: For program point L6946(lines 6946 6952) no Hoare annotation was computed. [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6187(lines 6187 6197) no Hoare annotation was computed. [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-07-21 12:22:01,673 INFO L902 garLoopResultBuilder]: At program point L6121(line 6121) the Hoare annotation is: true [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6947-1(line 6947) no Hoare annotation was computed. [2022-07-21 12:22:01,673 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-21 12:22:01,673 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-21 12:22:01,673 INFO L902 garLoopResultBuilder]: At program point L6221(line 6221) the Hoare annotation is: true [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6188(line 6188) no Hoare annotation was computed. [2022-07-21 12:22:01,673 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-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6189(lines 6189 6193) no Hoare annotation was computed. [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6057(line 6057) no Hoare annotation was computed. [2022-07-21 12:22:01,673 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-21 12:22:01,673 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-21 12:22:01,673 INFO L902 garLoopResultBuilder]: At program point L6058(line 6058) the Hoare annotation is: true [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6190-1(line 6190) no Hoare annotation was computed. [2022-07-21 12:22:01,673 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-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6917-1(lines 6917 6920) no Hoare annotation was computed. [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6950-1(line 6950) no Hoare annotation was computed. [2022-07-21 12:22:01,673 INFO L899 garLoopResultBuilder]: For program point L6917(lines 6917 6920) no Hoare annotation was computed. [2022-07-21 12:22:01,674 INFO L895 garLoopResultBuilder]: At program point L6918(line 6918) the Hoare annotation is: false [2022-07-21 12:22:01,674 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-21 12:22:01,674 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-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6159(line 6159) no Hoare annotation was computed. [2022-07-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6027(lines 6027 6222) no Hoare annotation was computed. [2022-07-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6093(line 6093) no Hoare annotation was computed. [2022-07-21 12:22:01,674 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-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6127(line 6127) no Hoare annotation was computed. [2022-07-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6094(lines 6094 6098) no Hoare annotation was computed. [2022-07-21 12:22:01,674 INFO L902 garLoopResultBuilder]: At program point L6160(line 6160) the Hoare annotation is: true [2022-07-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6028(line 6028) no Hoare annotation was computed. [2022-07-21 12:22:01,674 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-21 12:22:01,674 INFO L902 garLoopResultBuilder]: At program point L6227(lines 5979 6229) the Hoare annotation is: true [2022-07-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6128(lines 6128 6164) no Hoare annotation was computed. [2022-07-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6029(lines 6029 6044) no Hoare annotation was computed. [2022-07-21 12:22:01,674 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-21 12:22:01,674 INFO L899 garLoopResultBuilder]: For program point L6195(line 6195) no Hoare annotation was computed. [2022-07-21 12:22:01,674 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-21 12:22:01,675 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-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6130(lines 6130 6161) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L902 garLoopResultBuilder]: At program point L6196(line 6196) the Hoare annotation is: true [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6041) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6064(line 6064) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,675 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-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6131(line 6131) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6065(lines 6065 6125) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6132(lines 6132 6137) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6033(lines 6033 6037) no Hoare annotation was computed. [2022-07-21 12:22:01,675 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-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6166(line 6166) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6067(lines 6067 6122) no Hoare annotation was computed. [2022-07-21 12:22:01,675 INFO L899 garLoopResultBuilder]: For program point L6100(line 6100) no Hoare annotation was computed. [2022-07-21 12:22:01,675 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-21 12:22:01,675 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-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6167(lines 6167 6182) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6101(lines 6101 6108) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6068(line 6068) no Hoare annotation was computed. [2022-07-21 12:22:01,676 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-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6003-1(line 6003) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6069(lines 6069 6077) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6169(lines 6169 6179) no Hoare annotation was computed. [2022-07-21 12:22:01,676 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-21 12:22:01,676 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-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6170(line 6170) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6075) no Hoare annotation was computed. [2022-07-21 12:22:01,676 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-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6005-1(line 6005) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6171(lines 6171 6175) no Hoare annotation was computed. [2022-07-21 12:22:01,676 INFO L899 garLoopResultBuilder]: For program point L6039(line 6039) no Hoare annotation was computed. [2022-07-21 12:22:01,677 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-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6139(line 6139) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6172-1(line 6172) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6205(lines 6205 6215) no Hoare annotation was computed. [2022-07-21 12:22:01,677 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-21 12:22:01,677 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-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6007-1(line 6007) no Hoare annotation was computed. [2022-07-21 12:22:01,677 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-21 12:22:01,677 INFO L902 garLoopResultBuilder]: At program point L6040(line 6040) the Hoare annotation is: true [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L5974-1(line 5974) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6965-1(lines 6964 6982) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6965(lines 6965 6968) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6206(line 6206) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6157) no Hoare annotation was computed. [2022-07-21 12:22:01,677 INFO L895 garLoopResultBuilder]: At program point L6966(line 6966) the Hoare annotation is: false [2022-07-21 12:22:01,677 INFO L899 garLoopResultBuilder]: For program point L6207(lines 6207 6211) no Hoare annotation was computed. [2022-07-21 12:22:01,677 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-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6009-1(line 6009) no Hoare annotation was computed. [2022-07-21 12:22:01,678 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-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6142(lines 6142 6150) no Hoare annotation was computed. [2022-07-21 12:22:01,678 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-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6142-2(lines 6140 6156) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6110(line 6110) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,678 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-21 12:22:01,678 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-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6011-1(line 6011) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6969(lines 6964 6982) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6111(lines 6111 6118) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6177(line 6177) no Hoare annotation was computed. [2022-07-21 12:22:01,678 INFO L895 garLoopResultBuilder]: At program point L6970(line 6970) the Hoare annotation is: false [2022-07-21 12:22:01,678 INFO L902 garLoopResultBuilder]: At program point L6178(line 6178) the Hoare annotation is: true [2022-07-21 12:22:01,678 INFO L899 garLoopResultBuilder]: For program point L6079(line 6079) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point L6046(line 6046) no Hoare annotation was computed. [2022-07-21 12:22:01,679 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-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-07-21 12:22:01,679 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-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L902 garLoopResultBuilder]: At program point always_connectedENTRY(lines 5837 5842) the Hoare annotation is: true [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point always_connectedFINAL(lines 5837 5842) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point always_connectedEXIT(lines 5837 5842) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L902 garLoopResultBuilder]: At program point ldv_undef_int_negativeENTRY(lines 6336 6349) the Hoare annotation is: true [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point L6343-1(lines 6343 6346) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point L6343(lines 6343 6346) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L902 garLoopResultBuilder]: At program point L6344(line 6344) the Hoare annotation is: true [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeFINAL(lines 6336 6349) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point L6341-1(line 6341) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeEXIT(lines 6336 6349) no Hoare annotation was computed. [2022-07-21 12:22:01,679 INFO L902 garLoopResultBuilder]: At program point L6341(line 6341) the Hoare annotation is: true [2022-07-21 12:22:01,682 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 12:22:01,683 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 12:22:01,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 12:22:01 BoogieIcfgContainer [2022-07-21 12:22:01,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 12:22:01,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 12:22:01,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 12:22:01,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 12:22:01,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:21:54" (3/4) ... [2022-07-21 12:22:01,700 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 12:22:01,704 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-07-21 12:22:01,704 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-21 12:22:01,704 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_udev [2022-07-21 12:22:01,704 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-21 12:22:01,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-07-21 12:22:01,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 12:22:01,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-07-21 12:22:01,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-07-21 12:22:01,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure always_connected [2022-07-21 12:22:01,705 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int_negative [2022-07-21 12:22:01,718 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-07-21 12:22:01,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-21 12:22:01,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 12:22:01,721 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 12:22:01,722 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 12:22:01,744 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-21 12:22:01,744 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-21 12:22:01,744 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-21 12:22:01,744 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-21 12:22:01,745 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-21 12:22:01,745 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-21 12:22:01,745 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-21 12:22:01,866 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 12:22:01,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 12:22:01,866 INFO L158 Benchmark]: Toolchain (without parser) took 9724.26ms. Allocated memory was 62.9MB in the beginning and 306.2MB in the end (delta: 243.3MB). Free memory was 34.3MB in the beginning and 208.5MB in the end (delta: -174.2MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,866 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.7MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 12:22:01,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1086.37ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 34.1MB in the beginning and 36.0MB in the end (delta: -1.8MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.62ms. Allocated memory is still 83.9MB. Free memory was 36.0MB in the beginning and 27.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,867 INFO L158 Benchmark]: Boogie Preprocessor took 158.01ms. Allocated memory was 83.9MB in the beginning and 127.9MB in the end (delta: 44.0MB). Free memory was 27.8MB in the beginning and 74.7MB in the end (delta: -46.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,867 INFO L158 Benchmark]: RCFGBuilder took 1017.51ms. Allocated memory is still 127.9MB. Free memory was 74.7MB in the beginning and 52.9MB in the end (delta: 21.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,867 INFO L158 Benchmark]: TraceAbstraction took 7167.38ms. Allocated memory was 127.9MB in the beginning and 306.2MB in the end (delta: 178.3MB). Free memory was 51.7MB in the beginning and 239.9MB in the end (delta: -188.2MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,867 INFO L158 Benchmark]: Witness Printer took 168.01ms. Allocated memory is still 306.2MB. Free memory was 239.9MB in the beginning and 208.5MB in the end (delta: 31.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-21 12:22:01,868 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.23ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.7MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1086.37ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 34.1MB in the beginning and 36.0MB in the end (delta: -1.8MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.62ms. Allocated memory is still 83.9MB. Free memory was 36.0MB in the beginning and 27.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 158.01ms. Allocated memory was 83.9MB in the beginning and 127.9MB in the end (delta: 44.0MB). Free memory was 27.8MB in the beginning and 74.7MB in the end (delta: -46.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.51ms. Allocated memory is still 127.9MB. Free memory was 74.7MB in the beginning and 52.9MB in the end (delta: 21.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7167.38ms. Allocated memory was 127.9MB in the beginning and 306.2MB in the end (delta: 178.3MB). Free memory was 51.7MB in the beginning and 239.9MB in the end (delta: -188.2MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. * Witness Printer took 168.01ms. Allocated memory is still 306.2MB. Free memory was 239.9MB in the beginning and 208.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.1s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, 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.1s 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 660 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 567 PreInvPairs, 725 NumberOfFragments, 882 HoareAnnotationTreeSize, 567 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 70 FomulaSimplificationsInter, 7028 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s 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-21 12:22:01,900 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