./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fba957c5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-fba957c-m [2023-11-23 10:18:03,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 10:18:03,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 10:18:03,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 10:18:03,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 10:18:03,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 10:18:03,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 10:18:03,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 10:18:03,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 10:18:03,339 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 10:18:03,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 10:18:03,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 10:18:03,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 10:18:03,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 10:18:03,342 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 10:18:03,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 10:18:03,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 10:18:03,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 10:18:03,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 10:18:03,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 10:18:03,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 10:18:03,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 10:18:03,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 10:18:03,346 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 10:18:03,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 10:18:03,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 10:18:03,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 10:18:03,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 10:18:03,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:18:03,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 10:18:03,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 10:18:03,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 10:18:03,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 10:18:03,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 10:18:03,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 10:18:03,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 10:18:03,349 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 10:18:03,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 10:18:03,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 10:18:03,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4e522f7269f01a0f0108ec2341cf17a6d715eaf63b892b25236d9e51e23a874 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 10:18:03,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 10:18:03,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 10:18:03,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 10:18:03,572 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 10:18:03,572 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 10:18:03,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-23 10:18:04,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 10:18:04,835 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 10:18:04,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-23 10:18:04,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ec59545/3fb0e00ee9f54bd1b719003ff297cbcf/FLAG5d1cd01ab [2023-11-23 10:18:04,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ec59545/3fb0e00ee9f54bd1b719003ff297cbcf [2023-11-23 10:18:04,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 10:18:04,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 10:18:04,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 10:18:04,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 10:18:04,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 10:18:04,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:18:04" (1/1) ... [2023-11-23 10:18:04,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a83bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:04, skipping insertion in model container [2023-11-23 10:18:04,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:18:04" (1/1) ... [2023-11-23 10:18:04,931 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 10:18:05,357 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-23 10:18:05,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:18:05,403 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 10:18:05,513 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i[71148,71161] [2023-11-23 10:18:05,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 10:18:05,534 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:18:05,534 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 10:18:05,540 INFO L206 MainTranslator]: Completed translation [2023-11-23 10:18:05,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05 WrapperNode [2023-11-23 10:18:05,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 10:18:05,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 10:18:05,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 10:18:05,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 10:18:05,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,647 INFO L138 Inliner]: procedures = 102, calls = 434, calls flagged for inlining = 49, calls inlined = 44, statements flattened = 1146 [2023-11-23 10:18:05,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 10:18:05,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 10:18:05,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 10:18:05,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 10:18:05,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 10:18:05,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 10:18:05,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 10:18:05,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 10:18:05,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (1/1) ... [2023-11-23 10:18:05,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 10:18:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:18:05,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 10:18:05,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 10:18:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-23 10:18:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-23 10:18:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-23 10:18:05,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 10:18:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-23 10:18:05,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-23 10:18:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-23 10:18:05,834 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-23 10:18:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 10:18:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-23 10:18:05,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-23 10:18:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure extract_value [2023-11-23 10:18:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure extract_value [2023-11-23 10:18:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 10:18:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 10:18:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2023-11-23 10:18:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2023-11-23 10:18:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 10:18:05,836 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2023-11-23 10:18:05,836 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2023-11-23 10:18:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 10:18:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-23 10:18:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-23 10:18:05,837 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_bmc_delete [2023-11-23 10:18:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_bmc_delete [2023-11-23 10:18:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 10:18:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-23 10:18:05,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-23 10:18:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure ibmpex_send_message [2023-11-23 10:18:05,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ibmpex_send_message [2023-11-23 10:18:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-23 10:18:05,839 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-23 10:18:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 10:18:05,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 10:18:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-23 10:18:05,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-23 10:18:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2023-11-23 10:18:05,840 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2023-11-23 10:18:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-23 10:18:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-23 10:18:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-23 10:18:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-23 10:18:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-23 10:18:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-23 10:18:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 10:18:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2023-11-23 10:18:05,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2023-11-23 10:18:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2023-11-23 10:18:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2023-11-23 10:18:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-23 10:18:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-23 10:18:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-23 10:18:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 10:18:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 10:18:06,092 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 10:18:06,094 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 10:18:06,855 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 10:18:06,932 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 10:18:06,932 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 10:18:06,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:18:06 BoogieIcfgContainer [2023-11-23 10:18:06,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 10:18:06,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 10:18:06,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 10:18:06,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 10:18:06,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:18:04" (1/3) ... [2023-11-23 10:18:06,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4277833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:18:06, skipping insertion in model container [2023-11-23 10:18:06,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:05" (2/3) ... [2023-11-23 10:18:06,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4277833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:18:06, skipping insertion in model container [2023-11-23 10:18:06,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:18:06" (3/3) ... [2023-11-23 10:18:06,938 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-ibmpex-ko--130_7a--d631323.i [2023-11-23 10:18:06,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 10:18:06,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 10:18:06,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 10:18:06,990 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@bd1e390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 10:18:06,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 10:18:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 165 states have (on average 1.4) internal successors, (231), 170 states have internal predecessors, (231), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-23 10:18:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-23 10:18:07,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:07,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:07,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:07,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1876682886, now seen corresponding path program 1 times [2023-11-23 10:18:07,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:07,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906846480] [2023-11-23 10:18:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 10:18:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 10:18:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 10:18:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 10:18:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 10:18:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:07,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906846480] [2023-11-23 10:18:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906846480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783267327] [2023-11-23 10:18:07,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:07,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:07,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:07,723 INFO L87 Difference]: Start difference. First operand has 239 states, 165 states have (on average 1.4) internal successors, (231), 170 states have internal predecessors, (231), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-23 10:18:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:09,119 INFO L93 Difference]: Finished difference Result 552 states and 806 transitions. [2023-11-23 10:18:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:18:09,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2023-11-23 10:18:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:09,130 INFO L225 Difference]: With dead ends: 552 [2023-11-23 10:18:09,130 INFO L226 Difference]: Without dead ends: 303 [2023-11-23 10:18:09,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:09,143 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 197 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:09,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 973 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 10:18:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-11-23 10:18:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 233. [2023-11-23 10:18:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 166 states have internal predecessors, (223), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-23 10:18:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2023-11-23 10:18:09,187 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 99 [2023-11-23 10:18:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:09,188 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2023-11-23 10:18:09,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-23 10:18:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2023-11-23 10:18:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:18:09,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:09,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:09,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 10:18:09,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:09,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash -208057355, now seen corresponding path program 1 times [2023-11-23 10:18:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813842154] [2023-11-23 10:18:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:09,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813842154] [2023-11-23 10:18:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813842154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:09,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:18:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658097588] [2023-11-23 10:18:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:09,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:18:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:18:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:18:09,419 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:10,161 INFO L93 Difference]: Finished difference Result 486 states and 684 transitions. [2023-11-23 10:18:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:18:10,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-23 10:18:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:10,163 INFO L225 Difference]: With dead ends: 486 [2023-11-23 10:18:10,164 INFO L226 Difference]: Without dead ends: 257 [2023-11-23 10:18:10,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:10,165 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:10,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 598 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 10:18:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-23 10:18:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2023-11-23 10:18:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 164 states have (on average 1.3658536585365855) internal successors, (224), 167 states have internal predecessors, (224), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-23 10:18:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2023-11-23 10:18:10,180 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 105 [2023-11-23 10:18:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:10,181 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2023-11-23 10:18:10,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2023-11-23 10:18:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:18:10,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:10,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:10,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 10:18:10,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:10,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -262450253, now seen corresponding path program 1 times [2023-11-23 10:18:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559059082] [2023-11-23 10:18:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:10,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559059082] [2023-11-23 10:18:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559059082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:10,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254859509] [2023-11-23 10:18:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:10,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:10,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:10,363 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:11,610 INFO L93 Difference]: Finished difference Result 561 states and 802 transitions. [2023-11-23 10:18:11,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:18:11,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-23 10:18:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:11,613 INFO L225 Difference]: With dead ends: 561 [2023-11-23 10:18:11,613 INFO L226 Difference]: Without dead ends: 331 [2023-11-23 10:18:11,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:11,614 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 207 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:11,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1014 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 10:18:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-23 10:18:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 236. [2023-11-23 10:18:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 166 states have (on average 1.3614457831325302) internal successors, (226), 169 states have internal predecessors, (226), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-23 10:18:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2023-11-23 10:18:11,630 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 105 [2023-11-23 10:18:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:11,630 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2023-11-23 10:18:11,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2023-11-23 10:18:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:18:11,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:11,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:11,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 10:18:11,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:11,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1660777781, now seen corresponding path program 1 times [2023-11-23 10:18:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958941366] [2023-11-23 10:18:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958941366] [2023-11-23 10:18:11,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958941366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:11,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:18:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861544619] [2023-11-23 10:18:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:11,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:18:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:18:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:18:11,774 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:12,627 INFO L93 Difference]: Finished difference Result 492 states and 690 transitions. [2023-11-23 10:18:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:18:12,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-23 10:18:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:12,630 INFO L225 Difference]: With dead ends: 492 [2023-11-23 10:18:12,630 INFO L226 Difference]: Without dead ends: 260 [2023-11-23 10:18:12,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:12,631 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:12,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 598 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 10:18:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-23 10:18:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2023-11-23 10:18:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 170 states have internal predecessors, (227), 52 states have call successors, (52), 18 states have call predecessors, (52), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-23 10:18:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 329 transitions. [2023-11-23 10:18:12,656 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 329 transitions. Word has length 105 [2023-11-23 10:18:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:12,658 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 329 transitions. [2023-11-23 10:18:12,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 329 transitions. [2023-11-23 10:18:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 10:18:12,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:12,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:12,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 10:18:12,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:12,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1151304691, now seen corresponding path program 1 times [2023-11-23 10:18:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710874692] [2023-11-23 10:18:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710874692] [2023-11-23 10:18:13,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710874692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:13,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699684386] [2023-11-23 10:18:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:13,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:13,006 INFO L87 Difference]: Start difference. First operand 237 states and 329 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:14,321 INFO L93 Difference]: Finished difference Result 766 states and 1085 transitions. [2023-11-23 10:18:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 10:18:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-11-23 10:18:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:14,325 INFO L225 Difference]: With dead ends: 766 [2023-11-23 10:18:14,325 INFO L226 Difference]: Without dead ends: 762 [2023-11-23 10:18:14,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-23 10:18:14,327 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 945 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:14,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 781 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 10:18:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-23 10:18:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 693. [2023-11-23 10:18:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 491 states have (on average 1.3584521384928716) internal successors, (667), 498 states have internal predecessors, (667), 150 states have call successors, (150), 52 states have call predecessors, (150), 51 states have return successors, (152), 148 states have call predecessors, (152), 148 states have call successors, (152) [2023-11-23 10:18:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 969 transitions. [2023-11-23 10:18:14,370 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 969 transitions. Word has length 105 [2023-11-23 10:18:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:14,370 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 969 transitions. [2023-11-23 10:18:14,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-23 10:18:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 969 transitions. [2023-11-23 10:18:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 10:18:14,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:14,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:14,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 10:18:14,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:14,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1007883240, now seen corresponding path program 1 times [2023-11-23 10:18:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741754298] [2023-11-23 10:18:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741754298] [2023-11-23 10:18:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741754298] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:18:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65324376] [2023-11-23 10:18:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:18:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:18:14,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 10:18:14,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 10:18:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:14,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 10:18:14,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:18:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 10:18:15,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 10:18:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65324376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 10:18:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 10:18:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280564753] [2023-11-23 10:18:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 10:18:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 10:18:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:18:15,034 INFO L87 Difference]: Start difference. First operand 693 states and 969 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-23 10:18:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:15,400 INFO L93 Difference]: Finished difference Result 1384 states and 1937 transitions. [2023-11-23 10:18:15,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 10:18:15,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2023-11-23 10:18:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:15,406 INFO L225 Difference]: With dead ends: 1384 [2023-11-23 10:18:15,406 INFO L226 Difference]: Without dead ends: 1151 [2023-11-23 10:18:15,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:18:15,407 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 311 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:15,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 804 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 10:18:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2023-11-23 10:18:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 921. [2023-11-23 10:18:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 653 states have (on average 1.356814701378254) internal successors, (886), 662 states have internal predecessors, (886), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-23 10:18:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1286 transitions. [2023-11-23 10:18:15,444 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1286 transitions. Word has length 113 [2023-11-23 10:18:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:15,444 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1286 transitions. [2023-11-23 10:18:15,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-23 10:18:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1286 transitions. [2023-11-23 10:18:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:18:15,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:15,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:15,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 10:18:15,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 10:18:15,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:15,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1607293947, now seen corresponding path program 1 times [2023-11-23 10:18:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:15,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223554446] [2023-11-23 10:18:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:18:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 10:18:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223554446] [2023-11-23 10:18:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223554446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274568327] [2023-11-23 10:18:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:15,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:15,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:15,905 INFO L87 Difference]: Start difference. First operand 921 states and 1286 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:17,257 INFO L93 Difference]: Finished difference Result 2430 states and 3513 transitions. [2023-11-23 10:18:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:18:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-23 10:18:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:17,264 INFO L225 Difference]: With dead ends: 2430 [2023-11-23 10:18:17,264 INFO L226 Difference]: Without dead ends: 1513 [2023-11-23 10:18:17,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:17,268 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 256 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:17,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1203 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 10:18:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-23 10:18:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 929. [2023-11-23 10:18:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 661 states have (on average 1.3524962178517397) internal successors, (894), 670 states have internal predecessors, (894), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-23 10:18:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1294 transitions. [2023-11-23 10:18:17,329 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1294 transitions. Word has length 150 [2023-11-23 10:18:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:17,329 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1294 transitions. [2023-11-23 10:18:17,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1294 transitions. [2023-11-23 10:18:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:18:17,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:17,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:17,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 10:18:17,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:17,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash 842306183, now seen corresponding path program 1 times [2023-11-23 10:18:17,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742335893] [2023-11-23 10:18:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:18:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 10:18:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:17,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742335893] [2023-11-23 10:18:17,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742335893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:17,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:17,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:18:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844255751] [2023-11-23 10:18:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:17,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:18:17,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:18:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:18:17,539 INFO L87 Difference]: Start difference. First operand 929 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:18,379 INFO L93 Difference]: Finished difference Result 1950 states and 2739 transitions. [2023-11-23 10:18:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 10:18:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-23 10:18:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:18,383 INFO L225 Difference]: With dead ends: 1950 [2023-11-23 10:18:18,383 INFO L226 Difference]: Without dead ends: 1025 [2023-11-23 10:18:18,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:18,386 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 138 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:18,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 598 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-23 10:18:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-23 10:18:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 933. [2023-11-23 10:18:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 665 states have (on average 1.350375939849624) internal successors, (898), 674 states have internal predecessors, (898), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-23 10:18:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1298 transitions. [2023-11-23 10:18:18,447 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1298 transitions. Word has length 150 [2023-11-23 10:18:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:18,448 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1298 transitions. [2023-11-23 10:18:18,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1298 transitions. [2023-11-23 10:18:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-23 10:18:18,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:18,449 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:18,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 10:18:18,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:18,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash -529501115, now seen corresponding path program 1 times [2023-11-23 10:18:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437538819] [2023-11-23 10:18:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 10:18:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 10:18:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:18,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437538819] [2023-11-23 10:18:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437538819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:18,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714742196] [2023-11-23 10:18:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:18,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:18,689 INFO L87 Difference]: Start difference. First operand 933 states and 1298 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:20,154 INFO L93 Difference]: Finished difference Result 2906 states and 4247 transitions. [2023-11-23 10:18:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:18:20,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2023-11-23 10:18:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:20,162 INFO L225 Difference]: With dead ends: 2906 [2023-11-23 10:18:20,162 INFO L226 Difference]: Without dead ends: 1977 [2023-11-23 10:18:20,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:20,165 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 422 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:20,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1347 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 10:18:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-23 10:18:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 941. [2023-11-23 10:18:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 673 states have (on average 1.3462109955423478) internal successors, (906), 682 states have internal predecessors, (906), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-23 10:18:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1306 transitions. [2023-11-23 10:18:20,215 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1306 transitions. Word has length 150 [2023-11-23 10:18:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:20,216 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1306 transitions. [2023-11-23 10:18:20,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1306 transitions. [2023-11-23 10:18:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 10:18:20,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:20,219 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:20,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 10:18:20,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:20,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2065847726, now seen corresponding path program 1 times [2023-11-23 10:18:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:20,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63536280] [2023-11-23 10:18:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 10:18:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-23 10:18:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63536280] [2023-11-23 10:18:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63536280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:20,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:20,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:20,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587789354] [2023-11-23 10:18:20,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:20,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:20,463 INFO L87 Difference]: Start difference. First operand 941 states and 1306 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:22,034 INFO L93 Difference]: Finished difference Result 3090 states and 4533 transitions. [2023-11-23 10:18:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:18:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-11-23 10:18:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:22,043 INFO L225 Difference]: With dead ends: 3090 [2023-11-23 10:18:22,044 INFO L226 Difference]: Without dead ends: 2153 [2023-11-23 10:18:22,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:22,047 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 475 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:22,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1525 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-23 10:18:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2023-11-23 10:18:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 949. [2023-11-23 10:18:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 681 states have (on average 1.342143906020558) internal successors, (914), 690 states have internal predecessors, (914), 199 states have call successors, (199), 69 states have call predecessors, (199), 68 states have return successors, (201), 197 states have call predecessors, (201), 197 states have call successors, (201) [2023-11-23 10:18:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1314 transitions. [2023-11-23 10:18:22,102 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1314 transitions. Word has length 151 [2023-11-23 10:18:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:22,105 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1314 transitions. [2023-11-23 10:18:22,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1314 transitions. [2023-11-23 10:18:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-23 10:18:22,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:22,107 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:22,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 10:18:22,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:22,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1885893366, now seen corresponding path program 1 times [2023-11-23 10:18:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312316425] [2023-11-23 10:18:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-23 10:18:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 10:18:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:22,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312316425] [2023-11-23 10:18:22,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312316425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:22,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:22,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958820810] [2023-11-23 10:18:22,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:22,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:22,419 INFO L87 Difference]: Start difference. First operand 949 states and 1314 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:23,565 INFO L93 Difference]: Finished difference Result 2278 states and 3223 transitions. [2023-11-23 10:18:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:18:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2023-11-23 10:18:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:23,570 INFO L225 Difference]: With dead ends: 2278 [2023-11-23 10:18:23,570 INFO L226 Difference]: Without dead ends: 1333 [2023-11-23 10:18:23,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:23,573 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 228 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:23,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 985 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 10:18:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-23 10:18:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1012. [2023-11-23 10:18:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 736 states have (on average 1.346467391304348) internal successors, (991), 745 states have internal predecessors, (991), 207 states have call successors, (207), 69 states have call predecessors, (207), 68 states have return successors, (209), 205 states have call predecessors, (209), 205 states have call successors, (209) [2023-11-23 10:18:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1407 transitions. [2023-11-23 10:18:23,623 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1407 transitions. Word has length 151 [2023-11-23 10:18:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:23,623 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1407 transitions. [2023-11-23 10:18:23,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-23 10:18:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1407 transitions. [2023-11-23 10:18:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-23 10:18:23,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:23,625 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:23,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 10:18:23,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:23,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash -728050790, now seen corresponding path program 1 times [2023-11-23 10:18:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637800410] [2023-11-23 10:18:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:18:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 10:18:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637800410] [2023-11-23 10:18:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637800410] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 10:18:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974208467] [2023-11-23 10:18:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 10:18:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 10:18:23,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 10:18:23,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 10:18:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:24,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 10:18:24,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 10:18:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 10:18:24,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 10:18:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 10:18:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974208467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 10:18:24,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 10:18:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2023-11-23 10:18:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267433557] [2023-11-23 10:18:24,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 10:18:24,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 10:18:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 10:18:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:24,467 INFO L87 Difference]: Start difference. First operand 1012 states and 1407 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 10:18:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:25,638 INFO L93 Difference]: Finished difference Result 2538 states and 3631 transitions. [2023-11-23 10:18:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 10:18:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 152 [2023-11-23 10:18:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:25,644 INFO L225 Difference]: With dead ends: 2538 [2023-11-23 10:18:25,644 INFO L226 Difference]: Without dead ends: 1530 [2023-11-23 10:18:25,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:18:25,647 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 208 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:25,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 989 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 10:18:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2023-11-23 10:18:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1316. [2023-11-23 10:18:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 992 states have (on average 1.3538306451612903) internal successors, (1343), 1001 states have internal predecessors, (1343), 255 states have call successors, (255), 69 states have call predecessors, (255), 68 states have return successors, (257), 253 states have call predecessors, (257), 253 states have call successors, (257) [2023-11-23 10:18:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1855 transitions. [2023-11-23 10:18:25,698 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1855 transitions. Word has length 152 [2023-11-23 10:18:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:25,698 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1855 transitions. [2023-11-23 10:18:25,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 6 states have internal predecessors, (112), 5 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-23 10:18:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1855 transitions. [2023-11-23 10:18:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-23 10:18:25,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:25,702 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 10:18:25,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 10:18:25,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 10:18:25,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:25,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1006770323, now seen corresponding path program 1 times [2023-11-23 10:18:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518144633] [2023-11-23 10:18:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:18:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-23 10:18:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-23 10:18:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518144633] [2023-11-23 10:18:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518144633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:26,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:18:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847338816] [2023-11-23 10:18:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:26,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:18:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:18:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:18:26,161 INFO L87 Difference]: Start difference. First operand 1316 states and 1855 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-23 10:18:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:27,487 INFO L93 Difference]: Finished difference Result 2063 states and 2947 transitions. [2023-11-23 10:18:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:18:27,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2023-11-23 10:18:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:27,491 INFO L225 Difference]: With dead ends: 2063 [2023-11-23 10:18:27,491 INFO L226 Difference]: Without dead ends: 1057 [2023-11-23 10:18:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:18:27,494 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 396 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1011 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-23 10:18:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-11-23 10:18:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 983. [2023-11-23 10:18:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 739 states have (on average 1.3355886332882274) internal successors, (987), 746 states have internal predecessors, (987), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-23 10:18:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1371 transitions. [2023-11-23 10:18:27,532 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1371 transitions. Word has length 160 [2023-11-23 10:18:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:27,532 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1371 transitions. [2023-11-23 10:18:27,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-23 10:18:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1371 transitions. [2023-11-23 10:18:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-23 10:18:27,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:27,535 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:27,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 10:18:27,536 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:27,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -53197984, now seen corresponding path program 1 times [2023-11-23 10:18:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:27,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872147812] [2023-11-23 10:18:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:18:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-23 10:18:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-23 10:18:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-23 10:18:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872147812] [2023-11-23 10:18:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872147812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:27,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:27,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 10:18:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265836267] [2023-11-23 10:18:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:27,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 10:18:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:27,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 10:18:27,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 10:18:27,791 INFO L87 Difference]: Start difference. First operand 983 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-23 10:18:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:29,225 INFO L93 Difference]: Finished difference Result 2634 states and 3786 transitions. [2023-11-23 10:18:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 10:18:29,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 180 [2023-11-23 10:18:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:29,232 INFO L225 Difference]: With dead ends: 2634 [2023-11-23 10:18:29,232 INFO L226 Difference]: Without dead ends: 1655 [2023-11-23 10:18:29,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 10:18:29,235 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 304 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:29,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1291 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-23 10:18:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2023-11-23 10:18:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 989. [2023-11-23 10:18:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 745 states have (on average 1.3328859060402685) internal successors, (993), 752 states have internal predecessors, (993), 192 states have call successors, (192), 52 states have call predecessors, (192), 51 states have return successors, (192), 190 states have call predecessors, (192), 190 states have call successors, (192) [2023-11-23 10:18:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1377 transitions. [2023-11-23 10:18:29,277 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1377 transitions. Word has length 180 [2023-11-23 10:18:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:29,277 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1377 transitions. [2023-11-23 10:18:29,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-23 10:18:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1377 transitions. [2023-11-23 10:18:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-23 10:18:29,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:29,280 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:29,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 10:18:29,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:29,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1940924286, now seen corresponding path program 1 times [2023-11-23 10:18:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027867480] [2023-11-23 10:18:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:18:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-23 10:18:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-23 10:18:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-23 10:18:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027867480] [2023-11-23 10:18:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027867480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:29,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:29,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 10:18:29,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738691036] [2023-11-23 10:18:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:29,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 10:18:29,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:29,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 10:18:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 10:18:29,529 INFO L87 Difference]: Start difference. First operand 989 states and 1377 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-23 10:18:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:30,598 INFO L93 Difference]: Finished difference Result 1899 states and 2651 transitions. [2023-11-23 10:18:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 10:18:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 190 [2023-11-23 10:18:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:30,602 INFO L225 Difference]: With dead ends: 1899 [2023-11-23 10:18:30,602 INFO L226 Difference]: Without dead ends: 914 [2023-11-23 10:18:30,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 10:18:30,606 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 469 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:30,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 599 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 10:18:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-23 10:18:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 843. [2023-11-23 10:18:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 619 states have (on average 1.310177705977383) internal successors, (811), 626 states have internal predecessors, (811), 172 states have call successors, (172), 52 states have call predecessors, (172), 51 states have return successors, (172), 170 states have call predecessors, (172), 170 states have call successors, (172) [2023-11-23 10:18:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1155 transitions. [2023-11-23 10:18:30,643 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1155 transitions. Word has length 190 [2023-11-23 10:18:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:30,644 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1155 transitions. [2023-11-23 10:18:30,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-23 10:18:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1155 transitions. [2023-11-23 10:18:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-23 10:18:30,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 10:18:30,646 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:30,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 10:18:30,647 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 10:18:30,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 10:18:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1015934522, now seen corresponding path program 2 times [2023-11-23 10:18:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 10:18:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248956727] [2023-11-23 10:18:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 10:18:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 10:18:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-23 10:18:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 10:18:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 10:18:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 10:18:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 10:18:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 10:18:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 10:18:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 10:18:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 10:18:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 10:18:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-23 10:18:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 10:18:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-23 10:18:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-23 10:18:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 10:18:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-23 10:18:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-23 10:18:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 10:18:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 10:18:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-23 10:18:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 10:18:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248956727] [2023-11-23 10:18:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248956727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 10:18:31,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 10:18:31,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 10:18:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827824458] [2023-11-23 10:18:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 10:18:31,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 10:18:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 10:18:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 10:18:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 10:18:31,101 INFO L87 Difference]: Start difference. First operand 843 states and 1155 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 10:18:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 10:18:32,338 INFO L93 Difference]: Finished difference Result 1214 states and 1697 transitions. [2023-11-23 10:18:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 10:18:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 190 [2023-11-23 10:18:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 10:18:32,339 INFO L225 Difference]: With dead ends: 1214 [2023-11-23 10:18:32,339 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 10:18:32,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-11-23 10:18:32,341 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 968 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 10:18:32,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 611 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 10:18:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 10:18:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 10:18:32,342 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-23 10:18:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 10:18:32,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2023-11-23 10:18:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 10:18:32,343 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 10:18:32,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 5 states have internal predecessors, (103), 5 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-23 10:18:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 10:18:32,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 10:18:32,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 10:18:32,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 10:18:32,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 10:18:54,993 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 2594 2596) no Hoare annotation was computed. [2023-11-23 10:18:54,994 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2594 2596) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse3 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse1 (= |old(#valid)| |#valid|))) (and (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse1) (or .cse0 .cse3 .cse1) (or .cse2 .cse3 .cse1 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:54,994 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2553 2555) the Hoare annotation is: true [2023-11-23 10:18:54,994 INFO L899 garLoopResultBuilder]: For program point ipmi_destroy_userEXIT(lines 2553 2555) no Hoare annotation was computed. [2023-11-23 10:18:54,994 INFO L895 garLoopResultBuilder]: At program point L2478(line 2478) the Hoare annotation is: (let ((.cse1 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse2 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)))) (and (or .cse0 .cse1) (or .cse2 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse1) (or .cse2 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse0))) [2023-11-23 10:18:54,994 INFO L899 garLoopResultBuilder]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2023-11-23 10:18:54,995 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2470 2484) the Hoare annotation is: (let ((.cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (< |old(~ldv_call_dev_attr_of_sensor_device_attribute~0)| 1)) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)))) (and (or (and .cse0 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) .cse1 (< ~ldv_count_1~0 (+ 5 |old(~ldv_count_2~0)|)) .cse2) (or .cse3 .cse0 .cse2) (or (< ~ldv_count_1~0 (+ 2 |old(~ldv_count_2~0)|)) .cse3 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0)) (or (< ~ldv_count_1~0 (+ |old(~ldv_count_2~0)| 1)) .cse3 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (or .cse1 (not (= |old(~ldv_count_2~0)| 0)) (< ~ldv_count_1~0 6) (= ~ldv_count_2~0 0)))) [2023-11-23 10:18:54,995 INFO L899 garLoopResultBuilder]: For program point L2473-1(lines 2473 2481) no Hoare annotation was computed. [2023-11-23 10:18:54,995 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2481) no Hoare annotation was computed. [2023-11-23 10:18:54,995 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_file_dev_attr_of_sensor_device_attributeEXIT(lines 2470 2484) no Hoare annotation was computed. [2023-11-23 10:18:54,995 INFO L899 garLoopResultBuilder]: For program point wait_for_completionEXIT(lines 2590 2592) no Hoare annotation was computed. [2023-11-23 10:18:54,995 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2590 2592) the Hoare annotation is: true [2023-11-23 10:18:54,995 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2545 2547) the Hoare annotation is: true [2023-11-23 10:18:54,995 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 2545 2547) no Hoare annotation was computed. [2023-11-23 10:18:54,996 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 2530 2532) no Hoare annotation was computed. [2023-11-23 10:18:54,996 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2530 2532) the Hoare annotation is: true [2023-11-23 10:18:54,996 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 2412 2417) the Hoare annotation is: true [2023-11-23 10:18:54,996 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2415) no Hoare annotation was computed. [2023-11-23 10:18:54,996 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2412 2417) no Hoare annotation was computed. [2023-11-23 10:18:54,996 INFO L899 garLoopResultBuilder]: For program point L1662(line 1662) no Hoare annotation was computed. [2023-11-23 10:18:54,996 INFO L899 garLoopResultBuilder]: For program point L1662-2(line 1662) no Hoare annotation was computed. [2023-11-23 10:18:54,996 INFO L895 garLoopResultBuilder]: At program point L1662-4(line 1662) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:54,997 INFO L899 garLoopResultBuilder]: For program point L1662-5(line 1662) no Hoare annotation was computed. [2023-11-23 10:18:54,997 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1658 1665) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:54,997 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 1658 1665) no Hoare annotation was computed. [2023-11-23 10:18:54,997 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:54,997 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-23 10:18:54,997 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1649 1656) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:54,997 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 1649 1656) no Hoare annotation was computed. [2023-11-23 10:18:54,998 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2023-11-23 10:18:54,998 INFO L899 garLoopResultBuilder]: For program point L1567-2(line 1567) no Hoare annotation was computed. [2023-11-23 10:18:54,998 INFO L899 garLoopResultBuilder]: For program point L1567-4(line 1567) no Hoare annotation was computed. [2023-11-23 10:18:54,998 INFO L899 garLoopResultBuilder]: For program point extract_valueEXIT(lines 1676 1683) no Hoare annotation was computed. [2023-11-23 10:18:54,998 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1676 1683) the Hoare annotation is: true [2023-11-23 10:18:54,998 INFO L899 garLoopResultBuilder]: For program point L2203-1(line 2203) no Hoare annotation was computed. [2023-11-23 10:18:54,998 INFO L902 garLoopResultBuilder]: At program point L2234(line 2234) the Hoare annotation is: true [2023-11-23 10:18:54,998 INFO L895 garLoopResultBuilder]: At program point L2203(line 2203) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 10:18:54,998 INFO L902 garLoopResultBuilder]: At program point L2232(line 2232) the Hoare annotation is: true [2023-11-23 10:18:54,999 INFO L902 garLoopResultBuilder]: At program point L2230(line 2230) the Hoare annotation is: true [2023-11-23 10:18:54,999 INFO L899 garLoopResultBuilder]: For program point L2232-1(line 2232) no Hoare annotation was computed. [2023-11-23 10:18:54,999 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteEXIT(lines 2197 2237) no Hoare annotation was computed. [2023-11-23 10:18:54,999 INFO L899 garLoopResultBuilder]: For program point L2230-1(line 2230) no Hoare annotation was computed. [2023-11-23 10:18:54,999 INFO L899 garLoopResultBuilder]: For program point L2224(lines 2201 2236) no Hoare annotation was computed. [2023-11-23 10:18:54,999 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 2197 2237) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 10:18:54,999 INFO L899 garLoopResultBuilder]: For program point L2216(lines 2201 2236) no Hoare annotation was computed. [2023-11-23 10:18:54,999 INFO L902 garLoopResultBuilder]: At program point L2214(line 2214) the Hoare annotation is: true [2023-11-23 10:18:54,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##4(lines 2219 2222) no Hoare annotation was computed. [2023-11-23 10:18:55,000 INFO L899 garLoopResultBuilder]: For program point L2214-1(line 2214) no Hoare annotation was computed. [2023-11-23 10:18:55,000 INFO L899 garLoopResultBuilder]: For program point L2210(lines 2210 2213) no Hoare annotation was computed. [2023-11-23 10:18:55,000 INFO L895 garLoopResultBuilder]: At program point L2202(line 2202) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-23 10:18:55,000 INFO L899 garLoopResultBuilder]: For program point L2233-1(line 2233) no Hoare annotation was computed. [2023-11-23 10:18:55,000 INFO L899 garLoopResultBuilder]: For program point L2202-1(line 2202) no Hoare annotation was computed. [2023-11-23 10:18:55,000 INFO L902 garLoopResultBuilder]: At program point L2233(line 2233) the Hoare annotation is: true [2023-11-23 10:18:55,000 INFO L899 garLoopResultBuilder]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2023-11-23 10:18:55,000 INFO L902 garLoopResultBuilder]: At program point L2231(line 2231) the Hoare annotation is: true [2023-11-23 10:18:55,000 INFO L899 garLoopResultBuilder]: For program point L2225(lines 2225 2228) no Hoare annotation was computed. [2023-11-23 10:18:55,001 INFO L899 garLoopResultBuilder]: For program point ibmpex_bmc_deleteFINAL(lines 2197 2237) no Hoare annotation was computed. [2023-11-23 10:18:55,001 INFO L899 garLoopResultBuilder]: For program point L2215-1(line 2215) no Hoare annotation was computed. [2023-11-23 10:18:55,001 INFO L902 garLoopResultBuilder]: At program point L2215(line 2215) the Hoare annotation is: true [2023-11-23 10:18:55,001 INFO L899 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 2578 2580) no Hoare annotation was computed. [2023-11-23 10:18:55,001 INFO L902 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 2578 2580) the Hoare annotation is: true [2023-11-23 10:18:55,001 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 2424 2429) no Hoare annotation was computed. [2023-11-23 10:18:55,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2424 2429) the Hoare annotation is: true [2023-11-23 10:18:55,001 INFO L899 garLoopResultBuilder]: For program point ipmi_free_recv_msgEXIT(lines 2556 2558) no Hoare annotation was computed. [2023-11-23 10:18:55,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2556 2558) the Hoare annotation is: true [2023-11-23 10:18:55,002 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2023-11-23 10:18:55,002 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1631) no Hoare annotation was computed. [2023-11-23 10:18:55,002 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1634 1643) no Hoare annotation was computed. [2023-11-23 10:18:55,002 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1634 1643) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse1 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1)) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2) (or (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse0 .cse2) (or .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0)) .cse2) (or .cse3 .cse1 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:55,002 INFO L902 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: true [2023-11-23 10:18:55,002 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1634 1643) no Hoare annotation was computed. [2023-11-23 10:18:55,002 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2023-11-23 10:18:55,002 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2023-11-23 10:18:55,003 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageEXIT(lines 1695 1719) no Hoare annotation was computed. [2023-11-23 10:18:55,003 INFO L899 garLoopResultBuilder]: For program point ibmpex_send_messageFINAL(lines 1695 1719) no Hoare annotation was computed. [2023-11-23 10:18:55,003 INFO L895 garLoopResultBuilder]: At program point L1716(line 1716) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:55,003 INFO L899 garLoopResultBuilder]: For program point L1716-1(line 1716) no Hoare annotation was computed. [2023-11-23 10:18:55,003 INFO L902 garLoopResultBuilder]: At program point L1713(line 1713) the Hoare annotation is: true [2023-11-23 10:18:55,003 INFO L899 garLoopResultBuilder]: For program point L1713-1(line 1713) no Hoare annotation was computed. [2023-11-23 10:18:55,003 INFO L899 garLoopResultBuilder]: For program point L1707(lines 1707 1710) no Hoare annotation was computed. [2023-11-23 10:18:55,003 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1695 1719) the Hoare annotation is: (let ((.cse1 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (.cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0))) (.cse2 (< ~ldv_call_dev_attr_of_sensor_device_attribute~0 1))) (and (or .cse0 (< ~ldv_count_1~0 (+ ~ldv_count_2~0 1)) .cse1) (or .cse0 .cse1 .cse2) (or .cse0 .cse3 (< ~ldv_count_1~0 6) (not (= ~ldv_count_2~0 0))) (or .cse0 .cse3 .cse2 (< ~ldv_count_1~0 (+ 5 ~ldv_count_2~0))))) [2023-11-23 10:18:55,004 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 1703) no Hoare annotation was computed. [2023-11-23 10:18:55,004 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2539 2541) the Hoare annotation is: true [2023-11-23 10:18:55,004 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 2539 2541) no Hoare annotation was computed. [2023-11-23 10:18:55,004 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_name_returnLabel#1(lines 1755 1769) no Hoare annotation was computed. [2023-11-23 10:18:55,004 INFO L899 garLoopResultBuilder]: For program point L2282(line 2282) no Hoare annotation was computed. [2023-11-23 10:18:55,004 INFO L899 garLoopResultBuilder]: For program point L2249-1(lines 2238 2252) no Hoare annotation was computed. [2023-11-23 10:18:55,004 INFO L895 garLoopResultBuilder]: At program point L2249(line 2249) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,004 INFO L899 garLoopResultBuilder]: For program point L2084(lines 2084 2087) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point L1985(lines 1985 1988) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_returnLabel#1(lines 2012 2130) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point L1920(lines 1920 1923) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point L2350(line 2350) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point L2383-1(line 2383) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L895 garLoopResultBuilder]: At program point L2383(line 2383) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point L1954(lines 1954 1957) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L899 garLoopResultBuilder]: For program point L2351-1(line 2351) no Hoare annotation was computed. [2023-11-23 10:18:55,005 INFO L895 garLoopResultBuilder]: At program point L2351(line 2351) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,006 INFO L899 garLoopResultBuilder]: For program point L2153(lines 2153 2158) no Hoare annotation was computed. [2023-11-23 10:18:55,006 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 1859) no Hoare annotation was computed. [2023-11-23 10:18:55,006 INFO L895 garLoopResultBuilder]: At program point L2154(lines 2154 2155) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,006 INFO L899 garLoopResultBuilder]: For program point L2154-1(lines 2154 2155) no Hoare annotation was computed. [2023-11-23 10:18:55,006 INFO L899 garLoopResultBuilder]: For program point L1989(lines 1989 1995) no Hoare annotation was computed. [2023-11-23 10:18:55,006 INFO L899 garLoopResultBuilder]: For program point L2122(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:18:55,006 INFO L899 garLoopResultBuilder]: For program point L2089(lines 2089 2092) no Hoare annotation was computed. [2023-11-23 10:18:55,006 INFO L895 garLoopResultBuilder]: At program point L1726(line 1726) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L1726-1(line 1726) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L2354(line 2354) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L2189-1(line 2189) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L895 garLoopResultBuilder]: At program point L2189(line 2189) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L2123(lines 2123 2126) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L2057(lines 2057 2064) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L2057-1(lines 2048 2065) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L899 garLoopResultBuilder]: For program point L1925(lines 1925 1928) no Hoare annotation was computed. [2023-11-23 10:18:55,007 INFO L895 garLoopResultBuilder]: At program point L1727(line 1727) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L1727-1(line 1727) no Hoare annotation was computed. [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L2355-1(line 2355) no Hoare annotation was computed. [2023-11-23 10:18:55,008 INFO L895 garLoopResultBuilder]: At program point L2355(line 2355) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L2190(lines 2138 2195) no Hoare annotation was computed. [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 1995) no Hoare annotation was computed. [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L1992-2(lines 1989 1995) no Hoare annotation was computed. [2023-11-23 10:18:55,008 INFO L895 garLoopResultBuilder]: At program point L1761(line 1761) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L1728(line 1728) no Hoare annotation was computed. [2023-11-23 10:18:55,008 INFO L899 garLoopResultBuilder]: For program point L1761-1(line 1761) no Hoare annotation was computed. [2023-11-23 10:18:55,009 INFO L899 garLoopResultBuilder]: For program point L1728-2(lines 1728 1731) no Hoare annotation was computed. [2023-11-23 10:18:55,009 INFO L899 garLoopResultBuilder]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2023-11-23 10:18:55,009 INFO L895 garLoopResultBuilder]: At program point L2191(line 2191) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,009 INFO L895 garLoopResultBuilder]: At program point L1762(line 1762) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,009 INFO L899 garLoopResultBuilder]: For program point L1762-1(line 1762) no Hoare annotation was computed. [2023-11-23 10:18:55,009 INFO L899 garLoopResultBuilder]: For program point L2489-1(lines 2489 2497) no Hoare annotation was computed. [2023-11-23 10:18:55,009 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2497) no Hoare annotation was computed. [2023-11-23 10:18:55,009 INFO L895 garLoopResultBuilder]: At program point L2192(lines 2138 2195) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L1763(line 1763) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L1763-2(lines 1763 1766) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L2358(line 2358) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L2193(line 2193) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L2094(lines 2094 2097) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L2127-1(line 2127) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L895 garLoopResultBuilder]: At program point L2127(line 2127) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L2028(lines 2028 2031) no Hoare annotation was computed. [2023-11-23 10:18:55,010 INFO L899 garLoopResultBuilder]: For program point L2359-1(line 2359) no Hoare annotation was computed. [2023-11-23 10:18:55,011 INFO L895 garLoopResultBuilder]: At program point L2359(line 2359) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,011 INFO L899 garLoopResultBuilder]: For program point L1963(lines 1963 1966) no Hoare annotation was computed. [2023-11-23 10:18:55,011 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2495) no Hoare annotation was computed. [2023-11-23 10:18:55,011 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2267) no Hoare annotation was computed. [2023-11-23 10:18:55,011 INFO L895 garLoopResultBuilder]: At program point L2262(lines 2262 2263) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,011 INFO L899 garLoopResultBuilder]: For program point L2262-1(lines 2262 2263) no Hoare annotation was computed. [2023-11-23 10:18:55,011 INFO L895 garLoopResultBuilder]: At program point L1734(line 1734) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,011 INFO L899 garLoopResultBuilder]: For program point L1734-1(line 1734) no Hoare annotation was computed. [2023-11-23 10:18:55,011 INFO L895 garLoopResultBuilder]: At program point L2494(line 2494) the Hoare annotation is: false [2023-11-23 10:18:55,012 INFO L899 garLoopResultBuilder]: For program point ibmpex_register_bmc_returnLabel#1(lines 2131 2196) no Hoare annotation was computed. [2023-11-23 10:18:55,012 INFO L899 garLoopResultBuilder]: For program point L2362(line 2362) no Hoare annotation was computed. [2023-11-23 10:18:55,014 INFO L895 garLoopResultBuilder]: At program point L2264(line 2264) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,015 INFO L899 garLoopResultBuilder]: For program point L2264-1(lines 2254 2286) no Hoare annotation was computed. [2023-11-23 10:18:55,015 INFO L895 garLoopResultBuilder]: At program point L2033(line 2033) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,015 INFO L899 garLoopResultBuilder]: For program point L2033-1(line 2033) no Hoare annotation was computed. [2023-11-23 10:18:55,015 INFO L899 garLoopResultBuilder]: For program point L2166(lines 2166 2169) no Hoare annotation was computed. [2023-11-23 10:18:55,015 INFO L895 garLoopResultBuilder]: At program point L2100(line 2100) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,015 INFO L899 garLoopResultBuilder]: For program point L2100-1(line 2100) no Hoare annotation was computed. [2023-11-23 10:18:55,015 INFO L899 garLoopResultBuilder]: For program point L2365(lines 2337 2377) no Hoare annotation was computed. [2023-11-23 10:18:55,015 INFO L899 garLoopResultBuilder]: For program point L2101-1(line 2101) no Hoare annotation was computed. [2023-11-23 10:18:55,016 INFO L895 garLoopResultBuilder]: At program point L2101(line 2101) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,016 INFO L899 garLoopResultBuilder]: For program point L2035(lines 2035 2038) no Hoare annotation was computed. [2023-11-23 10:18:55,016 INFO L899 garLoopResultBuilder]: For program point L1936(lines 1936 1939) no Hoare annotation was computed. [2023-11-23 10:18:55,016 INFO L899 garLoopResultBuilder]: For program point L2399-1(line 2399) no Hoare annotation was computed. [2023-11-23 10:18:55,016 INFO L895 garLoopResultBuilder]: At program point L2399(line 2399) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,016 INFO L899 garLoopResultBuilder]: For program point $Ultimate##93(lines 1864 1867) no Hoare annotation was computed. [2023-11-23 10:18:55,016 INFO L899 garLoopResultBuilder]: For program point is_power_sensor_returnLabel#1(lines 1916 1931) no Hoare annotation was computed. [2023-11-23 10:18:55,016 INFO L899 garLoopResultBuilder]: For program point L2003(lines 2003 2008) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L899 garLoopResultBuilder]: For program point $Ultimate##83(lines 2117 2120) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L899 garLoopResultBuilder]: For program point get_bmc_data_returnLabel#1(lines 1842 1870) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L899 garLoopResultBuilder]: For program point L2368(lines 2368 2371) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L899 garLoopResultBuilder]: For program point L2269(lines 2269 2273) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L902 garLoopResultBuilder]: At program point ibmpex_exit_ldv_17748#1(lines 2302 2320) the Hoare annotation is: true [2023-11-23 10:18:55,017 INFO L899 garLoopResultBuilder]: For program point L2269-2(lines 2269 2273) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L899 garLoopResultBuilder]: For program point L2071(lines 2071 2074) no Hoare annotation was computed. [2023-11-23 10:18:55,017 INFO L895 garLoopResultBuilder]: At program point L2005(line 2005) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0) .cse1) (and .cse0 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse1))) [2023-11-23 10:18:55,018 INFO L899 garLoopResultBuilder]: For program point L2005-1(line 2005) no Hoare annotation was computed. [2023-11-23 10:18:55,018 INFO L899 garLoopResultBuilder]: For program point create_sensor_returnLabel#1(lines 1976 2011) no Hoare annotation was computed. [2023-11-23 10:18:55,018 INFO L899 garLoopResultBuilder]: For program point $Ultimate##73(lines 2077 2080) no Hoare annotation was computed. [2023-11-23 10:18:55,018 INFO L899 garLoopResultBuilder]: For program point ibmpex_find_sensors_exit_remove#1(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:18:55,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 10:18:55,018 INFO L899 garLoopResultBuilder]: For program point L2172(lines 2172 2177) no Hoare annotation was computed. [2023-11-23 10:18:55,019 INFO L899 garLoopResultBuilder]: For program point L2139-1(line 2139) no Hoare annotation was computed. [2023-11-23 10:18:55,019 INFO L895 garLoopResultBuilder]: At program point L2139(line 2139) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,019 INFO L899 garLoopResultBuilder]: For program point L1941(lines 1941 1944) no Hoare annotation was computed. [2023-11-23 10:18:55,019 INFO L899 garLoopResultBuilder]: For program point L2173-1(lines 2173 2174) no Hoare annotation was computed. [2023-11-23 10:18:55,019 INFO L895 garLoopResultBuilder]: At program point L2173(lines 2173 2174) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,019 INFO L902 garLoopResultBuilder]: At program point L2372(line 2372) the Hoare annotation is: true [2023-11-23 10:18:55,019 INFO L899 garLoopResultBuilder]: For program point $Ultimate##45(lines 1969 1972) no Hoare annotation was computed. [2023-11-23 10:18:55,019 INFO L899 garLoopResultBuilder]: For program point L2372-1(line 2372) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L899 garLoopResultBuilder]: For program point L2108(lines 2108 2111) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L899 garLoopResultBuilder]: For program point L2141(lines 2141 2145) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L899 garLoopResultBuilder]: For program point ibmpex_ver_check_returnLabel#1(lines 1720 1740) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L899 garLoopResultBuilder]: For program point is_temp_sensor_returnLabel#1(lines 1932 1947) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L895 garLoopResultBuilder]: At program point L2340(line 2340) the Hoare annotation is: (and (<= 6 ~ldv_count_1~0) (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0) (= ~ldv_count_2~0 0)) [2023-11-23 10:18:55,020 INFO L899 garLoopResultBuilder]: For program point L2274(lines 2274 2281) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L899 garLoopResultBuilder]: For program point L2340-1(line 2340) no Hoare annotation was computed. [2023-11-23 10:18:55,020 INFO L895 garLoopResultBuilder]: At program point L2274-2(lines 2274 2281) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,020 INFO L895 garLoopResultBuilder]: At program point L2142(line 2142) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,021 INFO L899 garLoopResultBuilder]: For program point L2142-1(line 2142) no Hoare annotation was computed. [2023-11-23 10:18:55,021 INFO L899 garLoopResultBuilder]: For program point L2043(lines 2043 2046) no Hoare annotation was computed. [2023-11-23 10:18:55,021 INFO L899 garLoopResultBuilder]: For program point power_sensor_multiplier_returnLabel#1(lines 1948 1975) no Hoare annotation was computed. [2023-11-23 10:18:55,021 INFO L895 garLoopResultBuilder]: At program point L1746(line 1746) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,021 INFO L899 garLoopResultBuilder]: For program point L1746-1(line 1746) no Hoare annotation was computed. [2023-11-23 10:18:55,021 INFO L899 garLoopResultBuilder]: For program point L2407-1(line 2407) no Hoare annotation was computed. [2023-11-23 10:18:55,022 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2337 2377) no Hoare annotation was computed. [2023-11-23 10:18:55,022 INFO L895 garLoopResultBuilder]: At program point L2407(line 2407) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,022 INFO L895 garLoopResultBuilder]: At program point L1747(line 1747) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,022 INFO L899 garLoopResultBuilder]: For program point L1747-1(line 1747) no Hoare annotation was computed. [2023-11-23 10:18:55,024 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 10:18:55,026 INFO L899 garLoopResultBuilder]: For program point L2342(lines 2342 2345) no Hoare annotation was computed. [2023-11-23 10:18:55,026 INFO L899 garLoopResultBuilder]: For program point L1748(line 1748) no Hoare annotation was computed. [2023-11-23 10:18:55,026 INFO L899 garLoopResultBuilder]: For program point L1748-2(lines 1748 1751) no Hoare annotation was computed. [2023-11-23 10:18:55,026 INFO L899 garLoopResultBuilder]: For program point L2310(line 2310) no Hoare annotation was computed. [2023-11-23 10:18:55,026 INFO L895 garLoopResultBuilder]: At program point L2178(line 2178) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,026 INFO L895 garLoopResultBuilder]: At program point L2112(line 2112) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2023-11-23 10:18:55,026 INFO L899 garLoopResultBuilder]: For program point L2178-1(line 2178) no Hoare annotation was computed. [2023-11-23 10:18:55,026 INFO L899 garLoopResultBuilder]: For program point L2112-1(line 2112) no Hoare annotation was computed. [2023-11-23 10:18:55,027 INFO L899 garLoopResultBuilder]: For program point L2245(lines 2245 2248) no Hoare annotation was computed. [2023-11-23 10:18:55,027 INFO L899 garLoopResultBuilder]: For program point L2113-1(line 2113) no Hoare annotation was computed. [2023-11-23 10:18:55,027 INFO L895 garLoopResultBuilder]: At program point L2113(line 2113) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse3 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 (= ~ldv_count_2~0 0) .cse2))) [2023-11-23 10:18:55,027 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,027 INFO L895 garLoopResultBuilder]: At program point L-1-4(line -1) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,027 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2023-11-23 10:18:55,027 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point L2114(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point L2081(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point L2048(lines 2048 2065) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point ibmpex_query_sensor_count_returnLabel#1(lines 1741 1754) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point L2181(lines 2181 2186) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L895 garLoopResultBuilder]: At program point L1983(line 1983) the Hoare annotation is: (let ((.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0)) (.cse2 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 2)) (.cse3 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse4 (= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 0)) (.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse0 (<= (+ 2 ~ldv_count_2~0) ~ldv_count_1~0) .cse2) (and (<= 6 ~ldv_count_1~0) .cse3 .cse4 (= ~ldv_count_2~0 0)) (and .cse0 (<= |ULTIMATE.start_ibmpex_find_sensors_~j~0#1| 1) (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)))) [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point $Ultimate##117(lines 2315 2318) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L899 garLoopResultBuilder]: For program point L1983-1(line 1983) no Hoare annotation was computed. [2023-11-23 10:18:55,028 INFO L895 garLoopResultBuilder]: At program point L2182(lines 2182 2183) the Hoare annotation is: (let ((.cse0 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 0)) (.cse2 (= ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 1)) (.cse1 (<= 1 ~ldv_call_dev_attr_of_sensor_device_attribute~0))) (or (and (<= 6 ~ldv_count_1~0) .cse0 (= ~ldv_count_2~0 0)) (and .cse0 .cse1 (<= (+ 5 ~ldv_count_2~0) ~ldv_count_1~0)) (and .cse2 (<= (+ ~ldv_count_2~0 1) ~ldv_count_1~0)) (and .cse2 .cse1))) [2023-11-23 10:18:55,029 INFO L899 garLoopResultBuilder]: For program point L2182-1(lines 2182 2183) no Hoare annotation was computed. [2023-11-23 10:18:55,029 INFO L899 garLoopResultBuilder]: For program point L2083(lines 2024 2129) no Hoare annotation was computed. [2023-11-23 10:18:55,029 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 2536 2538) no Hoare annotation was computed. [2023-11-23 10:18:55,029 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 2536 2538) the Hoare annotation is: true [2023-11-23 10:18:55,032 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 10:18:55,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 10:18:55,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:18:55,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:18:55,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:18:55,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:18:55,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:18:55,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 [2023-11-23 10:18:55,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 [2023-11-23 10:18:55,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 [2023-11-23 10:18:55,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:18:55 BoogieIcfgContainer [2023-11-23 10:18:55,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 10:18:55,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 10:18:55,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 10:18:55,060 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 10:18:55,060 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:18:06" (3/4) ... [2023-11-23 10:18:55,062 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 10:18:55,064 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_destroy_user [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure wait_for_completion [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ipmi_free_recv_msg [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_send_message [2023-11-23 10:18:55,065 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-23 10:18:55,066 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-23 10:18:55,066 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2023-11-23 10:18:55,066 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2023-11-23 10:18:55,066 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure extract_value [2023-11-23 10:18:55,066 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ibmpex_bmc_delete [2023-11-23 10:18:55,066 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-23 10:18:55,085 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 167 nodes and edges [2023-11-23 10:18:55,087 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2023-11-23 10:18:55,088 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-23 10:18:55,089 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 10:18:55,090 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 10:18:55,091 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 10:18:55,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 10:18:55,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 10:18:55,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 10:18:55,227 INFO L158 Benchmark]: Toolchain (without parser) took 50355.07ms. Allocated memory was 130.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 58.2MB in the beginning and 841.1MB in the end (delta: -782.9MB). Peak memory consumption was 236.2MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,227 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 89.6MB in the beginning and 89.5MB in the end (delta: 152.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 10:18:55,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.77ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 58.1MB in the beginning and 114.0MB in the end (delta: -55.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.13ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 104.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,228 INFO L158 Benchmark]: Boogie Preprocessor took 111.77ms. Allocated memory is still 182.5MB. Free memory was 104.5MB in the beginning and 97.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,228 INFO L158 Benchmark]: RCFGBuilder took 1170.04ms. Allocated memory is still 182.5MB. Free memory was 97.2MB in the beginning and 81.4MB in the end (delta: 15.8MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,228 INFO L158 Benchmark]: TraceAbstraction took 48125.42ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 80.4MB in the beginning and 863.1MB in the end (delta: -782.8MB). Peak memory consumption was 646.4MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,228 INFO L158 Benchmark]: Witness Printer took 166.98ms. Allocated memory is still 1.1GB. Free memory was 863.1MB in the beginning and 841.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 10:18:55,229 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.14ms. Allocated memory is still 130.0MB. Free memory was 89.6MB in the beginning and 89.5MB in the end (delta: 152.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.77ms. Allocated memory was 130.0MB in the beginning and 182.5MB in the end (delta: 52.4MB). Free memory was 58.1MB in the beginning and 114.0MB in the end (delta: -55.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.13ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 104.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.77ms. Allocated memory is still 182.5MB. Free memory was 104.5MB in the beginning and 97.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1170.04ms. Allocated memory is still 182.5MB. Free memory was 97.2MB in the beginning and 81.4MB in the end (delta: 15.8MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * TraceAbstraction took 48125.42ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 80.4MB in the beginning and 863.1MB in the end (delta: -782.8MB). Peak memory consumption was 646.4MB. Max. memory is 16.1GB. * Witness Printer took 166.98ms. Allocated memory is still 1.1GB. Free memory was 863.1MB in the beginning and 841.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_count_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute_2~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~ldv_call_dev_attr_of_sensor_device_attribute~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2415]: 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 19 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.1s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6344 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5800 mSDsluCounter, 14927 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9962 mSDsCounter, 2831 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10971 IncrementalHoareTripleChecker+Invalid, 13802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2831 mSolverCounterUnsat, 4965 mSDtfsCounter, 10971 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1171 GetRequests, 1067 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=12, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4772 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 74 LocationsWithAnnotation, 3384 PreInvPairs, 3669 NumberOfFragments, 2236 HoareAnnotationTreeSize, 3384 FomulaSimplifications, 32470946 FormulaSimplificationTreeSizeReduction, 17.7s HoareSimplificationTime, 74 FomulaSimplificationsInter, 125742 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2521 NumberOfCodeBlocks, 2521 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2654 ConstructedInterpolants, 0 QuantifiedInterpolants, 4624 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2958 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 1331/1335 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: 1695]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((((6 <= ldv_count_1) && (ldv_call_dev_attr_of_sensor_device_attribute_2 == 0)) && (ldv_count_2 == 0)) || (((ldv_call_dev_attr_of_sensor_device_attribute_2 == 0) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute)) && ((5 + ldv_count_2) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && ((ldv_count_2 + 1) <= ldv_count_1))) || ((ldv_call_dev_attr_of_sensor_device_attribute_2 == 1) && (1 <= ldv_call_dev_attr_of_sensor_device_attribute))) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 2302]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-23 10:18:55,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE