./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 e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP --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.3-dev-e7bb482 [2023-11-06 21:53:27,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:27,993 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 21:53:28,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:28,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:28,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:28,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:28,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:28,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:28,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:28,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:28,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:28,060 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:28,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:28,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:28,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:28,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:28,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:28,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:28,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:28,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:28,066 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:28,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:28,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:28,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:28,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:28,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:28,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:28,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:28,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:28,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:28,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:28,074 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:28,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:28,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:28,075 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:28,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP 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 [2023-11-06 21:53:28,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:28,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:28,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:28,461 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:28,462 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:28,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/../../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 [2023-11-06 21:53:31,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:32,302 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:32,303 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/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 [2023-11-06 21:53:32,339 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/data/0030ee388/7d4e8603f90d4e1592e787eb0ceb22f6/FLAG820fe55df [2023-11-06 21:53:32,360 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/data/0030ee388/7d4e8603f90d4e1592e787eb0ceb22f6 [2023-11-06 21:53:32,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:32,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:32,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:32,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:32,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:32,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:32" (1/1) ... [2023-11-06 21:53:32,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e5e6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:32, skipping insertion in model container [2023-11-06 21:53:32,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:32" (1/1) ... [2023-11-06 21:53:32,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:33,496 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/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] [2023-11-06 21:53:33,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:33,735 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:33,926 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/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] [2023-11-06 21:53:33,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:34,005 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:34,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34 WrapperNode [2023-11-06 21:53:34,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:34,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:34,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:34,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:34,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,179 INFO L138 Inliner]: procedures = 117, calls = 568, calls flagged for inlining = 30, calls inlined = 25, statements flattened = 1094 [2023-11-06 21:53:34,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:34,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:34,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:34,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:34,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:34,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:34,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:34,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:34,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (1/1) ... [2023-11-06 21:53:34,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:34,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:34,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:34,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-06 21:53:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-06 21:53:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:53:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-06 21:53:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-06 21:53:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2023-11-06 21:53:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2023-11-06 21:53:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2023-11-06 21:53:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2023-11-06 21:53:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-06 21:53:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-06 21:53:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-11-06 21:53:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-11-06 21:53:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:34,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:53:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev [2023-11-06 21:53:34,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev [2023-11-06 21:53:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-06 21:53:34,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-06 21:53:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:53:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:53:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:53:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:53:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure always_connected [2023-11-06 21:53:34,509 INFO L138 BoogieDeclarations]: Found implementation of procedure always_connected [2023-11-06 21:53:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:34,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:34,801 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:34,804 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:34,882 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-06 21:53:36,179 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:36,196 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:36,196 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:53:36,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:36 BoogieIcfgContainer [2023-11-06 21:53:36,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:36,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:36,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:36,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:36,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:32" (1/3) ... [2023-11-06 21:53:36,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7717b814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:36, skipping insertion in model container [2023-11-06 21:53:36,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:34" (2/3) ... [2023-11-06 21:53:36,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7717b814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:36, skipping insertion in model container [2023-11-06 21:53:36,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:36" (3/3) ... [2023-11-06 21:53:36,215 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2023-11-06 21:53:36,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:36,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:36,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:36,325 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f4f30a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:36,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:36,331 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) [2023-11-06 21:53:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 21:53:36,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:36,352 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] [2023-11-06 21:53:36,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:36,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 665515163, now seen corresponding path program 1 times [2023-11-06 21:53:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:36,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782217629] [2023-11-06 21:53:36,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:36,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-11-06 21:53:38,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:38,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782217629] [2023-11-06 21:53:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782217629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:38,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524541469] [2023-11-06 21:53:38,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:38,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:38,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:38,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:38,513 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) [2023-11-06 21:53:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:38,899 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2023-11-06 21:53:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:53:38,903 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 [2023-11-06 21:53:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:38,915 INFO L225 Difference]: With dead ends: 367 [2023-11-06 21:53:38,916 INFO L226 Difference]: Without dead ends: 170 [2023-11-06 21:53:38,922 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 [2023-11-06 21:53:38,926 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 26 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:38,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 588 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-06 21:53:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2023-11-06 21:53:38,987 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) [2023-11-06 21:53:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2023-11-06 21:53:38,991 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 118 [2023-11-06 21:53:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:38,992 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2023-11-06 21:53:38,993 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) [2023-11-06 21:53:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2023-11-06 21:53:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 21:53:38,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:38,997 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] [2023-11-06 21:53:38,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:38,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:38,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash -96288345, now seen corresponding path program 1 times [2023-11-06 21:53:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80972762] [2023-11-06 21:53:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-11-06 21:53:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80972762] [2023-11-06 21:53:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80972762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491548300] [2023-11-06 21:53:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:40,235 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) [2023-11-06 21:53:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:40,540 INFO L93 Difference]: Finished difference Result 435 states and 600 transitions. [2023-11-06 21:53:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:40,541 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 [2023-11-06 21:53:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:40,545 INFO L225 Difference]: With dead ends: 435 [2023-11-06 21:53:40,545 INFO L226 Difference]: Without dead ends: 283 [2023-11-06 21:53:40,547 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 [2023-11-06 21:53:40,549 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 204 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:40,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 707 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-06 21:53:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2023-11-06 21:53:40,578 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) [2023-11-06 21:53:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 376 transitions. [2023-11-06 21:53:40,582 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 376 transitions. Word has length 118 [2023-11-06 21:53:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:40,583 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 376 transitions. [2023-11-06 21:53:40,583 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) [2023-11-06 21:53:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 376 transitions. [2023-11-06 21:53:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 21:53:40,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:40,586 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] [2023-11-06 21:53:40,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:40,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:40,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -358901924, now seen corresponding path program 1 times [2023-11-06 21:53:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472817509] [2023-11-06 21:53:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-11-06 21:53:41,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:41,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472817509] [2023-11-06 21:53:41,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472817509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:41,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:41,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:41,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135042740] [2023-11-06 21:53:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:41,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:41,746 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) [2023-11-06 21:53:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:42,109 INFO L93 Difference]: Finished difference Result 730 states and 1030 transitions. [2023-11-06 21:53:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:42,110 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 [2023-11-06 21:53:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:42,115 INFO L225 Difference]: With dead ends: 730 [2023-11-06 21:53:42,115 INFO L226 Difference]: Without dead ends: 479 [2023-11-06 21:53:42,116 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 [2023-11-06 21:53:42,118 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 193 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:42,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 810 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-11-06 21:53:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2023-11-06 21:53:42,164 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) [2023-11-06 21:53:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 670 transitions. [2023-11-06 21:53:42,171 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 670 transitions. Word has length 117 [2023-11-06 21:53:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:42,179 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 670 transitions. [2023-11-06 21:53:42,179 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) [2023-11-06 21:53:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 670 transitions. [2023-11-06 21:53:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 21:53:42,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:42,187 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] [2023-11-06 21:53:42,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:42,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:42,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1959898998, now seen corresponding path program 1 times [2023-11-06 21:53:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383965973] [2023-11-06 21:53:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2023-11-06 21:53:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:43,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383965973] [2023-11-06 21:53:43,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383965973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:43,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:43,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220472201] [2023-11-06 21:53:43,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:43,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:43,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:43,381 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) [2023-11-06 21:53:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:43,640 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2023-11-06 21:53:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:43,641 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 [2023-11-06 21:53:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:43,652 INFO L225 Difference]: With dead ends: 477 [2023-11-06 21:53:43,653 INFO L226 Difference]: Without dead ends: 474 [2023-11-06 21:53:43,654 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 [2023-11-06 21:53:43,657 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 201 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:43,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 537 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-11-06 21:53:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2023-11-06 21:53:43,712 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) [2023-11-06 21:53:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 668 transitions. [2023-11-06 21:53:43,720 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 668 transitions. Word has length 137 [2023-11-06 21:53:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:43,721 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 668 transitions. [2023-11-06 21:53:43,722 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) [2023-11-06 21:53:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2023-11-06 21:53:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 21:53:43,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:43,728 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] [2023-11-06 21:53:43,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:53:43,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:43,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 627340524, now seen corresponding path program 1 times [2023-11-06 21:53:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697104440] [2023-11-06 21:53:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2023-11-06 21:53:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697104440] [2023-11-06 21:53:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697104440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:44,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9271625] [2023-11-06 21:53:44,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:44,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:44,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:44,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:44,795 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) [2023-11-06 21:53:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:44,981 INFO L93 Difference]: Finished difference Result 476 states and 669 transitions. [2023-11-06 21:53:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:44,982 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 [2023-11-06 21:53:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:44,986 INFO L225 Difference]: With dead ends: 476 [2023-11-06 21:53:44,986 INFO L226 Difference]: Without dead ends: 473 [2023-11-06 21:53:44,987 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 [2023-11-06 21:53:44,987 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 218 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:44,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 368 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:53:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-06 21:53:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2023-11-06 21:53:45,019 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) [2023-11-06 21:53:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 666 transitions. [2023-11-06 21:53:45,023 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 666 transitions. Word has length 138 [2023-11-06 21:53:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:45,023 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 666 transitions. [2023-11-06 21:53:45,024 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) [2023-11-06 21:53:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 666 transitions. [2023-11-06 21:53:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 21:53:45,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:45,026 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] [2023-11-06 21:53:45,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:53:45,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:45,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:45,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2027261639, now seen corresponding path program 1 times [2023-11-06 21:53:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:45,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647104623] [2023-11-06 21:53:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:45,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2023-11-06 21:53:46,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:46,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647104623] [2023-11-06 21:53:46,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647104623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:46,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:46,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138011660] [2023-11-06 21:53:46,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:46,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:46,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:46,084 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) [2023-11-06 21:53:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:46,350 INFO L93 Difference]: Finished difference Result 475 states and 667 transitions. [2023-11-06 21:53:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:46,351 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 [2023-11-06 21:53:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:46,354 INFO L225 Difference]: With dead ends: 475 [2023-11-06 21:53:46,355 INFO L226 Difference]: Without dead ends: 472 [2023-11-06 21:53:46,355 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 [2023-11-06 21:53:46,356 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 195 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:46,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 529 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-11-06 21:53:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2023-11-06 21:53:46,395 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) [2023-11-06 21:53:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 664 transitions. [2023-11-06 21:53:46,399 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 664 transitions. Word has length 139 [2023-11-06 21:53:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:46,400 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 664 transitions. [2023-11-06 21:53:46,401 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) [2023-11-06 21:53:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 664 transitions. [2023-11-06 21:53:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 21:53:46,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:46,405 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] [2023-11-06 21:53:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:53:46,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:46,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1579422095, now seen corresponding path program 1 times [2023-11-06 21:53:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883412987] [2023-11-06 21:53:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2023-11-06 21:53:47,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883412987] [2023-11-06 21:53:47,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883412987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:47,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:47,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:47,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698089045] [2023-11-06 21:53:47,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:47,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:47,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:47,523 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) [2023-11-06 21:53:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:47,827 INFO L93 Difference]: Finished difference Result 1334 states and 1900 transitions. [2023-11-06 21:53:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:47,827 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 [2023-11-06 21:53:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:47,835 INFO L225 Difference]: With dead ends: 1334 [2023-11-06 21:53:47,836 INFO L226 Difference]: Without dead ends: 886 [2023-11-06 21:53:47,838 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 [2023-11-06 21:53:47,839 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 241 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:47,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 541 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:53:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-11-06 21:53:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 880. [2023-11-06 21:53:47,917 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) [2023-11-06 21:53:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1252 transitions. [2023-11-06 21:53:47,925 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1252 transitions. Word has length 140 [2023-11-06 21:53:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:47,926 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1252 transitions. [2023-11-06 21:53:47,926 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) [2023-11-06 21:53:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1252 transitions. [2023-11-06 21:53:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-06 21:53:47,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:47,931 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] [2023-11-06 21:53:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:53:47,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:47,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1050241138, now seen corresponding path program 1 times [2023-11-06 21:53:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:47,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663134922] [2023-11-06 21:53:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 21:53:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 21:53:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-11-06 21:53:48,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663134922] [2023-11-06 21:53:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663134922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:48,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:53:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481440089] [2023-11-06 21:53:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:53:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:53:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:53:48,892 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) [2023-11-06 21:53:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:49,383 INFO L93 Difference]: Finished difference Result 1730 states and 2467 transitions. [2023-11-06 21:53:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:53:49,384 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 [2023-11-06 21:53:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:49,392 INFO L225 Difference]: With dead ends: 1730 [2023-11-06 21:53:49,393 INFO L226 Difference]: Without dead ends: 882 [2023-11-06 21:53:49,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:53:49,398 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 238 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:49,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1035 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-11-06 21:53:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 877. [2023-11-06 21:53:49,475 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) [2023-11-06 21:53:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1243 transitions. [2023-11-06 21:53:49,481 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1243 transitions. Word has length 159 [2023-11-06 21:53:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:49,482 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1243 transitions. [2023-11-06 21:53:49,482 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) [2023-11-06 21:53:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1243 transitions. [2023-11-06 21:53:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 21:53:49,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:49,486 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] [2023-11-06 21:53:49,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:53:49,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:49,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash 296332059, now seen corresponding path program 1 times [2023-11-06 21:53:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:49,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663694850] [2023-11-06 21:53:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 21:53:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 21:53:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-11-06 21:53:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663694850] [2023-11-06 21:53:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663694850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:53:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737343824] [2023-11-06 21:53:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:51,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:53:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:53:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:53:51,193 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) [2023-11-06 21:53:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:51,795 INFO L93 Difference]: Finished difference Result 2355 states and 3452 transitions. [2023-11-06 21:53:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:53:51,796 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 [2023-11-06 21:53:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:51,812 INFO L225 Difference]: With dead ends: 2355 [2023-11-06 21:53:51,812 INFO L226 Difference]: Without dead ends: 1510 [2023-11-06 21:53:51,815 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 [2023-11-06 21:53:51,818 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 306 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:51,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 2316 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:53:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2023-11-06 21:53:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 879. [2023-11-06 21:53:51,935 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) [2023-11-06 21:53:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1243 transitions. [2023-11-06 21:53:51,943 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1243 transitions. Word has length 164 [2023-11-06 21:53:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:51,944 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1243 transitions. [2023-11-06 21:53:51,945 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) [2023-11-06 21:53:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1243 transitions. [2023-11-06 21:53:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 21:53:51,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:51,950 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] [2023-11-06 21:53:51,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:53:51,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:51,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1563381600, now seen corresponding path program 1 times [2023-11-06 21:53:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217325843] [2023-11-06 21:53:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 21:53:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:53:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 21:53:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 21:53:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 21:53:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:53:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 21:53:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:53:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:53:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 21:53:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 21:53:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 21:53:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-11-06 21:53:53,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217325843] [2023-11-06 21:53:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217325843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:53,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:53,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:53:53,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774950771] [2023-11-06 21:53:53,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:53,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:53:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:53,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:53:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:53:53,552 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) [2023-11-06 21:53:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:54,085 INFO L93 Difference]: Finished difference Result 1190 states and 1736 transitions. [2023-11-06 21:53:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:53:54,086 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 [2023-11-06 21:53:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:54,087 INFO L225 Difference]: With dead ends: 1190 [2023-11-06 21:53:54,087 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 21:53:54,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:53:54,091 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 323 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:54,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1412 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:53:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 21:53:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 21:53:54,093 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) [2023-11-06 21:53:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 21:53:54,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2023-11-06 21:53:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:54,094 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 21:53:54,095 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) [2023-11-06 21:53:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 21:53:54,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 21:53:54,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:53:54,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:53:54,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 21:53:56,602 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 7015 7017) no Hoare annotation was computed. [2023-11-06 21:53:56,603 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7015 7017) the Hoare annotation is: true [2023-11-06 21:53:56,603 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 7015 7017) no Hoare annotation was computed. [2023-11-06 21:53:56,603 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevFINAL(lines 6853 6863) no Hoare annotation was computed. [2023-11-06 21:53:56,603 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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)) [2023-11-06 21:53:56,603 INFO L899 garLoopResultBuilder]: For program point L6856-1(lines 6856 6859) no Hoare annotation was computed. [2023-11-06 21:53:56,604 INFO L899 garLoopResultBuilder]: For program point L6856(lines 6856 6859) no Hoare annotation was computed. [2023-11-06 21:53:56,604 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))) [2023-11-06 21:53:56,604 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevEXIT(lines 6853 6863) no Hoare annotation was computed. [2023-11-06 21:53:56,604 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2023-11-06 21:53:56,604 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5757 5767) no Hoare annotation was computed. [2023-11-06 21:53:56,604 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5757 5767) no Hoare annotation was computed. [2023-11-06 21:53:56,605 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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))))) [2023-11-06 21:53:56,605 INFO L899 garLoopResultBuilder]: For program point L5764-1(line 5764) no Hoare annotation was computed. [2023-11-06 21:53:56,605 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))))) [2023-11-06 21:53:56,605 INFO L902 garLoopResultBuilder]: At program point L5764(line 5764) the Hoare annotation is: true [2023-11-06 21:53:56,605 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5720 5722) the Hoare annotation is: true [2023-11-06 21:53:56,605 INFO L899 garLoopResultBuilder]: For program point L5721-2(lines 5720 5722) no Hoare annotation was computed. [2023-11-06 21:53:56,606 INFO L899 garLoopResultBuilder]: For program point L5721(line 5721) no Hoare annotation was computed. [2023-11-06 21:53:56,606 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5720 5722) no Hoare annotation was computed. [2023-11-06 21:53:56,606 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 5776 5783) no Hoare annotation was computed. [2023-11-06 21:53:56,606 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5776 5783) the Hoare annotation is: true [2023-11-06 21:53:56,606 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 5776 5783) no Hoare annotation was computed. [2023-11-06 21:53:56,606 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6329 6335) no Hoare annotation was computed. [2023-11-06 21:53:56,606 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 6329 6335) the Hoare annotation is: true [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6329 6335) no Hoare annotation was computed. [2023-11-06 21:53:56,607 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 5792 5798) the Hoare annotation is: true [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5792 5798) no Hoare annotation was computed. [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point L6047(lines 6047 6062) no Hoare annotation was computed. [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point L6080-2(lines 6067 6122) no Hoare annotation was computed. [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2023-11-06 21:53:56,607 INFO L899 garLoopResultBuilder]: For program point L6080(lines 6080 6085) no Hoare annotation was computed. [2023-11-06 21:53:56,608 INFO L895 garLoopResultBuilder]: At program point ldv_mutex_unlock_udev_returnLabel#1(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)) [2023-11-06 21:53:56,608 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(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)) [2023-11-06 21:53:56,608 INFO L895 garLoopResultBuilder]: At program point m5632_recover_returnLabel#1(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)) [2023-11-06 21:53:56,608 INFO L899 garLoopResultBuilder]: For program point L6213(line 6213) no Hoare annotation was computed. [2023-11-06 21:53:56,609 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)) [2023-11-06 21:53:56,609 INFO L899 garLoopResultBuilder]: For program point L6081-1(line 6081) no Hoare annotation was computed. [2023-11-06 21:53:56,609 INFO L899 garLoopResultBuilder]: For program point L6973(lines 6964 6982) no Hoare annotation was computed. [2023-11-06 21:53:56,609 INFO L902 garLoopResultBuilder]: At program point L6214(line 6214) the Hoare annotation is: true [2023-11-06 21:53:56,609 INFO L895 garLoopResultBuilder]: At program point L6974(line 6974) the Hoare annotation is: false [2023-11-06 21:53:56,609 INFO L899 garLoopResultBuilder]: For program point L6049(lines 6049 6059) no Hoare annotation was computed. [2023-11-06 21:53:56,609 INFO L899 garLoopResultBuilder]: For program point L6050(line 6050) no Hoare annotation was computed. [2023-11-06 21:53:56,610 INFO L899 garLoopResultBuilder]: For program point L5852(lines 5852 5855) no Hoare annotation was computed. [2023-11-06 21:53:56,610 INFO L895 garLoopResultBuilder]: At program point ldv_usb_unlock_device_udev_returnLabel#1(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)) [2023-11-06 21:53:56,610 INFO L899 garLoopResultBuilder]: For program point L6051(lines 6051 6055) no Hoare annotation was computed. [2023-11-06 21:53:56,610 INFO L895 garLoopResultBuilder]: At program point cdc_subset_driver_exit_returnLabel#1(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)) [2023-11-06 21:53:56,610 INFO L895 garLoopResultBuilder]: At program point __ldv_usb_unlock_device_returnLabel#1(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)) [2023-11-06 21:53:56,610 INFO L899 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2023-11-06 21:53:56,611 INFO L899 garLoopResultBuilder]: For program point L6052-1(line 6052) no Hoare annotation was computed. [2023-11-06 21:53:56,611 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)) [2023-11-06 21:53:56,611 INFO L902 garLoopResultBuilder]: At program point L6977(lines 6962 6983) the Hoare annotation is: true [2023-11-06 21:53:56,611 INFO L899 garLoopResultBuilder]: For program point L6185(lines 6185 6200) no Hoare annotation was computed. [2023-11-06 21:53:56,611 INFO L895 garLoopResultBuilder]: At program point L6978(line 6978) the Hoare annotation is: false [2023-11-06 21:53:56,611 INFO L899 garLoopResultBuilder]: For program point L6945-1(line 6945) no Hoare annotation was computed. [2023-11-06 21:53:56,612 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)) [2023-11-06 21:53:56,612 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)) [2023-11-06 21:53:56,612 INFO L899 garLoopResultBuilder]: For program point L6087-1(line 6087) no Hoare annotation was computed. [2023-11-06 21:53:56,612 INFO L895 garLoopResultBuilder]: At program point ldv_usb_register_driver_14_returnLabel#1(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)) [2023-11-06 21:53:56,613 INFO L899 garLoopResultBuilder]: For program point L6120(line 6120) no Hoare annotation was computed. [2023-11-06 21:53:56,613 INFO L899 garLoopResultBuilder]: For program point L6946(lines 6946 6952) no Hoare annotation was computed. [2023-11-06 21:53:56,613 INFO L899 garLoopResultBuilder]: For program point L6187(lines 6187 6197) no Hoare annotation was computed. [2023-11-06 21:53:56,613 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2023-11-06 21:53:56,613 INFO L902 garLoopResultBuilder]: At program point L6121(line 6121) the Hoare annotation is: true [2023-11-06 21:53:56,614 INFO L895 garLoopResultBuilder]: At program point ldv_usb_lock_device_for_reset_12_returnLabel#1(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)))) [2023-11-06 21:53:56,614 INFO L899 garLoopResultBuilder]: For program point L6947-1(line 6947) no Hoare annotation was computed. [2023-11-06 21:53:56,614 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)) [2023-11-06 21:53:56,614 INFO L895 garLoopResultBuilder]: At program point ldv_memset_returnLabel#1(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)) [2023-11-06 21:53:56,614 INFO L902 garLoopResultBuilder]: At program point L6221(line 6221) the Hoare annotation is: true [2023-11-06 21:53:56,615 INFO L899 garLoopResultBuilder]: For program point L6188(line 6188) no Hoare annotation was computed. [2023-11-06 21:53:56,615 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 5979 6229) the Hoare annotation is: true [2023-11-06 21:53:56,615 INFO L899 garLoopResultBuilder]: For program point L6189(lines 6189 6193) no Hoare annotation was computed. [2023-11-06 21:53:56,615 INFO L899 garLoopResultBuilder]: For program point L6057(line 6057) no Hoare annotation was computed. [2023-11-06 21:53:56,615 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)) [2023-11-06 21:53:56,616 INFO L902 garLoopResultBuilder]: At program point L6058(line 6058) the Hoare annotation is: true [2023-11-06 21:53:56,616 INFO L899 garLoopResultBuilder]: For program point L6190-1(line 6190) no Hoare annotation was computed. [2023-11-06 21:53:56,616 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)) [2023-11-06 21:53:56,616 INFO L895 garLoopResultBuilder]: At program point L6025(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)) [2023-11-06 21:53:56,616 INFO L899 garLoopResultBuilder]: For program point L6917-1(lines 6917 6920) no Hoare annotation was computed. [2023-11-06 21:53:56,617 INFO L899 garLoopResultBuilder]: For program point L6950-1(line 6950) no Hoare annotation was computed. [2023-11-06 21:53:56,617 INFO L899 garLoopResultBuilder]: For program point L6917(lines 6917 6920) no Hoare annotation was computed. [2023-11-06 21:53:56,617 INFO L895 garLoopResultBuilder]: At program point usb_register_driver_returnLabel#1(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)) [2023-11-06 21:53:56,617 INFO L895 garLoopResultBuilder]: At program point main_ldv_final#1(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)) [2023-11-06 21:53:56,617 INFO L895 garLoopResultBuilder]: At program point L6918(line 6918) the Hoare annotation is: false [2023-11-06 21:53:56,618 INFO L899 garLoopResultBuilder]: For program point L6159(line 6159) no Hoare annotation was computed. [2023-11-06 21:53:56,618 INFO L899 garLoopResultBuilder]: For program point L6027(lines 6027 6222) no Hoare annotation was computed. [2023-11-06 21:53:56,618 INFO L899 garLoopResultBuilder]: For program point L6093(line 6093) no Hoare annotation was computed. [2023-11-06 21:53:56,618 INFO L895 garLoopResultBuilder]: At program point ldv_reset_resume_1_returnLabel#1(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)) [2023-11-06 21:53:56,618 INFO L899 garLoopResultBuilder]: For program point L6127(line 6127) no Hoare annotation was computed. [2023-11-06 21:53:56,618 INFO L899 garLoopResultBuilder]: For program point L6094(lines 6094 6098) no Hoare annotation was computed. [2023-11-06 21:53:56,619 INFO L902 garLoopResultBuilder]: At program point L6160(line 6160) the Hoare annotation is: true [2023-11-06 21:53:56,619 INFO L899 garLoopResultBuilder]: For program point L6028(line 6028) no Hoare annotation was computed. [2023-11-06 21:53:56,619 INFO L899 garLoopResultBuilder]: For program point L6128(lines 6128 6164) no Hoare annotation was computed. [2023-11-06 21:53:56,619 INFO L899 garLoopResultBuilder]: For program point L6029(lines 6029 6044) no Hoare annotation was computed. [2023-11-06 21:53:56,619 INFO L899 garLoopResultBuilder]: For program point L6195(line 6195) no Hoare annotation was computed. [2023-11-06 21:53:56,620 INFO L895 garLoopResultBuilder]: At program point usbnet_resume_returnLabel#1(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)) [2023-11-06 21:53:56,620 INFO L899 garLoopResultBuilder]: For program point L6130(lines 6130 6161) no Hoare annotation was computed. [2023-11-06 21:53:56,620 INFO L902 garLoopResultBuilder]: At program point L6196(line 6196) the Hoare annotation is: true [2023-11-06 21:53:56,620 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6041) no Hoare annotation was computed. [2023-11-06 21:53:56,620 INFO L899 garLoopResultBuilder]: For program point L6064(line 6064) no Hoare annotation was computed. [2023-11-06 21:53:56,620 INFO L899 garLoopResultBuilder]: For program point L6131(line 6131) no Hoare annotation was computed. [2023-11-06 21:53:56,621 INFO L899 garLoopResultBuilder]: For program point L6065(lines 6065 6125) no Hoare annotation was computed. [2023-11-06 21:53:56,621 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2023-11-06 21:53:56,621 INFO L895 garLoopResultBuilder]: At program point usb_deregister_returnLabel#1(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)) [2023-11-06 21:53:56,621 INFO L895 garLoopResultBuilder]: At program point ldv_usb_deregister_15_returnLabel#1(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)) [2023-11-06 21:53:56,621 INFO L899 garLoopResultBuilder]: For program point L6132(lines 6132 6137) no Hoare annotation was computed. [2023-11-06 21:53:56,622 INFO L899 garLoopResultBuilder]: For program point L6033(lines 6033 6037) no Hoare annotation was computed. [2023-11-06 21:53:56,622 INFO L899 garLoopResultBuilder]: For program point L6166(line 6166) no Hoare annotation was computed. [2023-11-06 21:53:56,622 INFO L899 garLoopResultBuilder]: For program point L6067(lines 6067 6122) no Hoare annotation was computed. [2023-11-06 21:53:56,622 INFO L899 garLoopResultBuilder]: For program point L6100(line 6100) no Hoare annotation was computed. [2023-11-06 21:53:56,622 INFO L899 garLoopResultBuilder]: For program point L6167(lines 6167 6182) no Hoare annotation was computed. [2023-11-06 21:53:56,622 INFO L899 garLoopResultBuilder]: For program point L6101(lines 6101 6108) no Hoare annotation was computed. [2023-11-06 21:53:56,623 INFO L899 garLoopResultBuilder]: For program point L6068(line 6068) no Hoare annotation was computed. [2023-11-06 21:53:56,623 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)) [2023-11-06 21:53:56,623 INFO L899 garLoopResultBuilder]: For program point L6003-1(line 6003) no Hoare annotation was computed. [2023-11-06 21:53:56,623 INFO L899 garLoopResultBuilder]: For program point L6069(lines 6069 6077) no Hoare annotation was computed. [2023-11-06 21:53:56,623 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,623 INFO L899 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2023-11-06 21:53:56,624 INFO L899 garLoopResultBuilder]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2023-11-06 21:53:56,624 INFO L899 garLoopResultBuilder]: For program point L6169(lines 6169 6179) no Hoare annotation was computed. [2023-11-06 21:53:56,624 INFO L895 garLoopResultBuilder]: At program point usbnet_suspend_returnLabel#1(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)) [2023-11-06 21:53:56,624 INFO L899 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2023-11-06 21:53:56,624 INFO L899 garLoopResultBuilder]: For program point L6170(line 6170) no Hoare annotation was computed. [2023-11-06 21:53:56,625 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6075) no Hoare annotation was computed. [2023-11-06 21:53:56,625 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)) [2023-11-06 21:53:56,625 INFO L899 garLoopResultBuilder]: For program point L6005-1(line 6005) no Hoare annotation was computed. [2023-11-06 21:53:56,625 INFO L895 garLoopResultBuilder]: At program point usbnet_probe_returnLabel#1(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)) [2023-11-06 21:53:56,625 INFO L899 garLoopResultBuilder]: For program point L6171(lines 6171 6175) no Hoare annotation was computed. [2023-11-06 21:53:56,626 INFO L899 garLoopResultBuilder]: For program point L6039(line 6039) no Hoare annotation was computed. [2023-11-06 21:53:56,626 INFO L899 garLoopResultBuilder]: For program point L6139(line 6139) no Hoare annotation was computed. [2023-11-06 21:53:56,626 INFO L899 garLoopResultBuilder]: For program point L6172-1(line 6172) no Hoare annotation was computed. [2023-11-06 21:53:56,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,626 INFO L899 garLoopResultBuilder]: For program point L6205(lines 6205 6215) no Hoare annotation was computed. [2023-11-06 21:53:56,627 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)) [2023-11-06 21:53:56,627 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)) [2023-11-06 21:53:56,627 INFO L899 garLoopResultBuilder]: For program point L6007-1(line 6007) no Hoare annotation was computed. [2023-11-06 21:53:56,627 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)) [2023-11-06 21:53:56,627 INFO L902 garLoopResultBuilder]: At program point L6040(line 6040) the Hoare annotation is: true [2023-11-06 21:53:56,627 INFO L899 garLoopResultBuilder]: For program point L5974-1(line 5974) no Hoare annotation was computed. [2023-11-06 21:53:56,628 INFO L899 garLoopResultBuilder]: For program point L6965-1(lines 6964 6982) no Hoare annotation was computed. [2023-11-06 21:53:56,628 INFO L899 garLoopResultBuilder]: For program point L6965(lines 6965 6968) no Hoare annotation was computed. [2023-11-06 21:53:56,628 INFO L895 garLoopResultBuilder]: At program point ldv_usb_driver_1_returnLabel#1(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)) [2023-11-06 21:53:56,628 INFO L899 garLoopResultBuilder]: For program point L6206(line 6206) no Hoare annotation was computed. [2023-11-06 21:53:56,628 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6157) no Hoare annotation was computed. [2023-11-06 21:53:56,629 INFO L895 garLoopResultBuilder]: At program point L6966(line 6966) the Hoare annotation is: false [2023-11-06 21:53:56,629 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,629 INFO L899 garLoopResultBuilder]: For program point L6207(lines 6207 6211) no Hoare annotation was computed. [2023-11-06 21:53:56,629 INFO L895 garLoopResultBuilder]: At program point cdc_subset_driver_init_returnLabel#1(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)) [2023-11-06 21:53:56,629 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)) [2023-11-06 21:53:56,629 INFO L899 garLoopResultBuilder]: For program point L6009-1(line 6009) no Hoare annotation was computed. [2023-11-06 21:53:56,630 INFO L899 garLoopResultBuilder]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2023-11-06 21:53:56,630 INFO L899 garLoopResultBuilder]: For program point L6142(lines 6142 6150) no Hoare annotation was computed. [2023-11-06 21:53:56,630 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)) [2023-11-06 21:53:56,630 INFO L899 garLoopResultBuilder]: For program point L6142-2(lines 6140 6156) no Hoare annotation was computed. [2023-11-06 21:53:56,631 INFO L895 garLoopResultBuilder]: At program point ldv_usb_lock_device_for_reset_udev_returnLabel#1(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)))) [2023-11-06 21:53:56,631 INFO L899 garLoopResultBuilder]: For program point L6110(line 6110) no Hoare annotation was computed. [2023-11-06 21:53:56,631 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,631 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)) [2023-11-06 21:53:56,631 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)) [2023-11-06 21:53:56,632 INFO L899 garLoopResultBuilder]: For program point L6011-1(line 6011) no Hoare annotation was computed. [2023-11-06 21:53:56,632 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,632 INFO L899 garLoopResultBuilder]: For program point L6969(lines 6964 6982) no Hoare annotation was computed. [2023-11-06 21:53:56,632 INFO L899 garLoopResultBuilder]: For program point L6111(lines 6111 6118) no Hoare annotation was computed. [2023-11-06 21:53:56,632 INFO L899 garLoopResultBuilder]: For program point L6177(line 6177) no Hoare annotation was computed. [2023-11-06 21:53:56,632 INFO L895 garLoopResultBuilder]: At program point L6970(line 6970) the Hoare annotation is: false [2023-11-06 21:53:56,633 INFO L895 garLoopResultBuilder]: At program point usb_reset_device_returnLabel#1(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)) [2023-11-06 21:53:56,633 INFO L902 garLoopResultBuilder]: At program point L6178(line 6178) the Hoare annotation is: true [2023-11-06 21:53:56,633 INFO L895 garLoopResultBuilder]: At program point ldv___ldv_usb_unlock_device_13_returnLabel#1(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)) [2023-11-06 21:53:56,633 INFO L899 garLoopResultBuilder]: For program point L6079(line 6079) no Hoare annotation was computed. [2023-11-06 21:53:56,634 INFO L899 garLoopResultBuilder]: For program point L6046(line 6046) no Hoare annotation was computed. [2023-11-06 21:53:56,634 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)) [2023-11-06 21:53:56,634 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2023-11-06 21:53:56,634 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,634 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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))))) [2023-11-06 21:53:56,635 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2023-11-06 21:53:56,635 INFO L899 garLoopResultBuilder]: For program point always_connectedFINAL(lines 5837 5842) no Hoare annotation was computed. [2023-11-06 21:53:56,635 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5837 5842) the Hoare annotation is: true [2023-11-06 21:53:56,635 INFO L899 garLoopResultBuilder]: For program point always_connectedEXIT(lines 5837 5842) no Hoare annotation was computed. [2023-11-06 21:53:56,635 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6336 6349) the Hoare annotation is: true [2023-11-06 21:53:56,636 INFO L899 garLoopResultBuilder]: For program point L6343-1(lines 6343 6346) no Hoare annotation was computed. [2023-11-06 21:53:56,636 INFO L899 garLoopResultBuilder]: For program point L6343(lines 6343 6346) no Hoare annotation was computed. [2023-11-06 21:53:56,636 INFO L902 garLoopResultBuilder]: At program point L6344(line 6344) the Hoare annotation is: true [2023-11-06 21:53:56,636 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeFINAL(lines 6336 6349) no Hoare annotation was computed. [2023-11-06 21:53:56,636 INFO L899 garLoopResultBuilder]: For program point L6341-1(line 6341) no Hoare annotation was computed. [2023-11-06 21:53:56,636 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeEXIT(lines 6336 6349) no Hoare annotation was computed. [2023-11-06 21:53:56,637 INFO L902 garLoopResultBuilder]: At program point L6341(line 6341) the Hoare annotation is: true [2023-11-06 21:53:56,640 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:56,643 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:53:56,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:53:56 BoogieIcfgContainer [2023-11-06 21:53:56,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:53:56,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:53:56,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:53:56,697 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:53:56,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:36" (3/4) ... [2023-11-06 21:53:56,700 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 21:53:56,706 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2023-11-06 21:53:56,707 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-06 21:53:56,708 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_udev [2023-11-06 21:53:56,708 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2023-11-06 21:53:56,708 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2023-11-06 21:53:56,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 21:53:56,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2023-11-06 21:53:56,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2023-11-06 21:53:56,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure always_connected [2023-11-06 21:53:56,709 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int_negative [2023-11-06 21:53:56,740 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2023-11-06 21:53:56,743 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-06 21:53:56,746 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 21:53:56,749 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 21:53:56,752 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 21:53:56,809 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)) [2023-11-06 21:53:56,809 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))) [2023-11-06 21:53:56,810 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)) [2023-11-06 21:53:56,810 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)) [2023-11-06 21:53:56,810 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))) [2023-11-06 21:53:56,812 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)) [2023-11-06 21:53:56,813 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)) [2023-11-06 21:53:57,198 WARN L115 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)) [2023-11-06 21:53:57,199 WARN L115 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))) [2023-11-06 21:53:57,199 WARN L115 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)) [2023-11-06 21:53:57,199 WARN L115 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)) [2023-11-06 21:53:57,200 WARN L115 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))) [2023-11-06 21:53:57,204 WARN L115 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)) [2023-11-06 21:53:57,205 WARN L115 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)) [2023-11-06 21:53:57,258 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:53:57,258 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 21:53:57,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:53:57,260 INFO L158 Benchmark]: Toolchain (without parser) took 24890.97ms. Allocated memory was 178.3MB in the beginning and 723.5MB in the end (delta: 545.3MB). Free memory was 130.4MB in the beginning and 475.4MB in the end (delta: -345.0MB). Peak memory consumption was 199.8MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,260 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 31.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:57,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1634.36ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 85.6MB in the end (delta: 44.8MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.27ms. Allocated memory is still 178.3MB. Free memory was 85.6MB in the beginning and 77.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,262 INFO L158 Benchmark]: Boogie Preprocessor took 235.64ms. Allocated memory is still 178.3MB. Free memory was 77.2MB in the beginning and 119.6MB in the end (delta: -42.5MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,263 INFO L158 Benchmark]: RCFGBuilder took 1784.20ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 119.6MB in the beginning and 199.8MB in the end (delta: -80.2MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,263 INFO L158 Benchmark]: TraceAbstraction took 20491.02ms. Allocated memory was 287.3MB in the beginning and 723.5MB in the end (delta: 436.2MB). Free memory was 199.8MB in the beginning and 511.0MB in the end (delta: -311.2MB). Peak memory consumption was 409.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,264 INFO L158 Benchmark]: Witness Printer took 562.02ms. Allocated memory is still 723.5MB. Free memory was 511.0MB in the beginning and 475.4MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-06 21:53:57,268 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 31.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1634.36ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 85.6MB in the end (delta: 44.8MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.27ms. Allocated memory is still 178.3MB. Free memory was 85.6MB in the beginning and 77.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 235.64ms. Allocated memory is still 178.3MB. Free memory was 77.2MB in the beginning and 119.6MB in the end (delta: -42.5MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1784.20ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 119.6MB in the beginning and 199.8MB in the end (delta: -80.2MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20491.02ms. Allocated memory was 287.3MB in the beginning and 723.5MB in the end (delta: 436.2MB). Free memory was 199.8MB in the beginning and 511.0MB in the end (delta: -311.2MB). Peak memory consumption was 409.1MB. Max. memory is 16.1GB. * Witness Printer took 562.02ms. Allocated memory is still 723.5MB. Free memory was 511.0MB in the beginning and 475.4MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2217 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2145 mSDsluCounter, 8843 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6387 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1329 IncrementalHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 2456 mSDtfsCounter, 1329 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s 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.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 660 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 567 PreInvPairs, 725 NumberOfFragments, 882 HoareAnnotationTreeSize, 567 FomulaSimplifications, 1590 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 70 FomulaSimplificationsInter, 4736 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 2506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2713/2713 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 5792]: Loop Invariant Derived loop invariant: 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: 6962]: Loop Invariant Derived loop invariant: 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: 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: 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: 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: -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: 5979]: Loop Invariant Derived loop invariant: 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: 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)) - 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)) RESULT: Ultimate proved your program to be correct! [2023-11-06 21:53:57,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dcfeb2c1-3f1a-4cba-896f-48b10ef6df49/bin/uautomizer-verify-WvqO1wxjHP/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