./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 15:25:43,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 15:25:43,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 15:25:43,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 15:25:43,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 15:25:43,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 15:25:43,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 15:25:43,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 15:25:43,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 15:25:43,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 15:25:43,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 15:25:43,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 15:25:43,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 15:25:43,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 15:25:43,303 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 15:25:43,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 15:25:43,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 15:25:43,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 15:25:43,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 15:25:43,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 15:25:43,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 15:25:43,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 15:25:43,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 15:25:43,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 15:25:43,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 15:25:43,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 15:25:43,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 15:25:43,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 15:25:43,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 15:25:43,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:25:43,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 15:25:43,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 15:25:43,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 15:25:43,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 15:25:43,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 15:25:43,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 15:25:43,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 15:25:43,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 15:25:43,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 15:25:43,314 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 -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2024-10-14 15:25:43,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 15:25:43,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 15:25:43,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 15:25:43,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 15:25:43,596 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 15:25:43,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-10-14 15:25:45,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 15:25:45,451 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 15:25:45,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-10-14 15:25:45,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b101b33e2/5603511b18ee4b388e91a5fd6c6cb9d7/FLAG27f8ef01c [2024-10-14 15:25:45,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b101b33e2/5603511b18ee4b388e91a5fd6c6cb9d7 [2024-10-14 15:25:45,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 15:25:45,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 15:25:45,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 15:25:45,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 15:25:45,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 15:25:45,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:45" (1/1) ... [2024-10-14 15:25:45,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@caf01ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:45, skipping insertion in model container [2024-10-14 15:25:45,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:45" (1/1) ... [2024-10-14 15:25:45,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 15:25:45,895 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2024-10-14 15:25:45,896 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2024-10-14 15:25:46,017 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2024-10-14 15:25:46,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:25:46,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 15:25:46,320 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2024-10-14 15:25:46,321 WARN L1336 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2024-10-14 15:25:46,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [1855] [2024-10-14 15:25:46,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1858] [2024-10-14 15:25:46,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1861] [2024-10-14 15:25:46,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [1864] [2024-10-14 15:25:46,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [1902] [2024-10-14 15:25:46,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2024-10-14 15:25:46,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:25:46,446 INFO L204 MainTranslator]: Completed translation [2024-10-14 15:25:46,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46 WrapperNode [2024-10-14 15:25:46,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 15:25:46,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 15:25:46,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 15:25:46,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 15:25:46,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,542 INFO L138 Inliner]: procedures = 114, calls = 292, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 960 [2024-10-14 15:25:46,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 15:25:46,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 15:25:46,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 15:25:46,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 15:25:46,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,633 INFO L175 MemorySlicer]: Split 79 memory accesses to 14 slices as follows [2, 5, 0, 4, 12, 1, 1, 10, 24, 4, 1, 12, 1, 2]. 30 percent of accesses are in the largest equivalence class. The 55 initializations are split as follows [2, 0, 0, 4, 1, 1, 1, 10, 18, 4, 1, 12, 0, 1]. The 9 writes are split as follows [0, 3, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 1, 0]. [2024-10-14 15:25:46,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 15:25:46,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 15:25:46,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 15:25:46,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 15:25:46,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (1/1) ... [2024-10-14 15:25:46,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:25:46,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:25:46,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 15:25:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 15:25:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2024-10-14 15:25:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2024-10-14 15:25:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2024-10-14 15:25:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2024-10-14 15:25:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-14 15:25:46,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-14 15:25:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 15:25:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 15:25:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 15:25:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 15:25:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 15:25:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 15:25:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 15:25:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 15:25:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 15:25:46,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 15:25:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-14 15:25:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-14 15:25:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-14 15:25:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-14 15:25:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2024-10-14 15:25:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2024-10-14 15:25:46,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2024-10-14 15:25:46,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2024-10-14 15:25:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 15:25:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 15:25:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2024-10-14 15:25:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2024-10-14 15:25:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2024-10-14 15:25:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2024-10-14 15:25:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-10-14 15:25:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-10-14 15:25:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-14 15:25:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-14 15:25:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2024-10-14 15:25:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 15:25:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-14 15:25:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-14 15:25:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-14 15:25:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-14 15:25:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2024-10-14 15:25:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2024-10-14 15:25:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2024-10-14 15:25:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2024-10-14 15:25:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2024-10-14 15:25:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2024-10-14 15:25:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 15:25:46,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 15:25:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 15:25:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2024-10-14 15:25:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2024-10-14 15:25:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 15:25:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2024-10-14 15:25:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2024-10-14 15:25:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 15:25:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 15:25:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 15:25:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 15:25:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-14 15:25:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-14 15:25:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-14 15:25:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 15:25:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2024-10-14 15:25:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2024-10-14 15:25:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 15:25:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 15:25:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 15:25:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 15:25:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-14 15:25:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-14 15:25:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2024-10-14 15:25:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2024-10-14 15:25:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2024-10-14 15:25:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2024-10-14 15:25:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 15:25:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 15:25:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 15:25:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 15:25:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-14 15:25:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-14 15:25:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-14 15:25:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-14 15:25:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-14 15:25:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-14 15:25:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-14 15:25:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-14 15:25:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-14 15:25:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-14 15:25:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-14 15:25:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2024-10-14 15:25:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-14 15:25:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-14 15:25:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2024-10-14 15:25:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2024-10-14 15:25:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 15:25:46,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-14 15:25:46,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-14 15:25:46,858 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2024-10-14 15:25:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2024-10-14 15:25:46,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 15:25:46,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 15:25:47,197 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 15:25:47,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 15:25:47,226 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-14 15:25:48,128 INFO L? ?]: Removed 301 outVars from TransFormulas that were not future-live. [2024-10-14 15:25:48,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 15:25:48,248 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 15:25:48,248 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 15:25:48,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:48 BoogieIcfgContainer [2024-10-14 15:25:48,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 15:25:48,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 15:25:48,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 15:25:48,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 15:25:48,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:25:45" (1/3) ... [2024-10-14 15:25:48,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3d9358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:48, skipping insertion in model container [2024-10-14 15:25:48,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:46" (2/3) ... [2024-10-14 15:25:48,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3d9358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:48, skipping insertion in model container [2024-10-14 15:25:48,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:48" (3/3) ... [2024-10-14 15:25:48,262 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2024-10-14 15:25:48,279 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 15:25:48,280 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 15:25:48,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 15:25:48,369 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@779ad0ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 15:25:48,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 15:25:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 222 states have (on average 1.490990990990991) internal successors, (331), 235 states have internal predecessors, (331), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 15:25:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 15:25:48,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:48,395 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:25:48,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:48,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 134384237, now seen corresponding path program 1 times [2024-10-14 15:25:48,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:48,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169425828] [2024-10-14 15:25:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 15:25:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:25:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169425828] [2024-10-14 15:25:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169425828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:48,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 15:25:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985496026] [2024-10-14 15:25:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:25:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:49,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:25:49,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 15:25:49,035 INFO L87 Difference]: Start difference. First operand has 321 states, 222 states have (on average 1.490990990990991) internal successors, (331), 235 states have internal predecessors, (331), 70 states have call successors, (70), 28 states have call predecessors, (70), 27 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 15:25:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:50,261 INFO L93 Difference]: Finished difference Result 949 states and 1399 transitions. [2024-10-14 15:25:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:25:50,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-10-14 15:25:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:50,285 INFO L225 Difference]: With dead ends: 949 [2024-10-14 15:25:50,285 INFO L226 Difference]: Without dead ends: 531 [2024-10-14 15:25:50,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:25:50,300 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 611 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:50,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 623 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 15:25:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-14 15:25:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 481. [2024-10-14 15:25:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 344 states have (on average 1.4534883720930232) internal successors, (500), 352 states have internal predecessors, (500), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 15:25:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 685 transitions. [2024-10-14 15:25:50,404 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 685 transitions. Word has length 44 [2024-10-14 15:25:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:50,406 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 685 transitions. [2024-10-14 15:25:50,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 15:25:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 685 transitions. [2024-10-14 15:25:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 15:25:50,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:50,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:25:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 15:25:50,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1091895189, now seen corresponding path program 1 times [2024-10-14 15:25:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416771324] [2024-10-14 15:25:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:25:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:25:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416771324] [2024-10-14 15:25:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416771324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 15:25:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910418293] [2024-10-14 15:25:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:50,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:25:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:25:50,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 15:25:50,575 INFO L87 Difference]: Start difference. First operand 481 states and 685 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 15:25:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:51,193 INFO L93 Difference]: Finished difference Result 533 states and 761 transitions. [2024-10-14 15:25:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 15:25:51,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2024-10-14 15:25:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:51,198 INFO L225 Difference]: With dead ends: 533 [2024-10-14 15:25:51,201 INFO L226 Difference]: Without dead ends: 529 [2024-10-14 15:25:51,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:25:51,203 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:51,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 676 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 15:25:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-14 15:25:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 482. [2024-10-14 15:25:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 345 states have (on average 1.4492753623188406) internal successors, (500), 353 states have internal predecessors, (500), 95 states have call successors, (95), 46 states have call predecessors, (95), 41 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 15:25:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 685 transitions. [2024-10-14 15:25:51,246 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 685 transitions. Word has length 49 [2024-10-14 15:25:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:51,247 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 685 transitions. [2024-10-14 15:25:51,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 15:25:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 685 transitions. [2024-10-14 15:25:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 15:25:51,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:51,250 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:25:51,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 15:25:51,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1356816329, now seen corresponding path program 1 times [2024-10-14 15:25:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29172493] [2024-10-14 15:25:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:51,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:25:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:25:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29172493] [2024-10-14 15:25:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29172493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 15:25:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906557293] [2024-10-14 15:25:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:25:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:25:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:25:51,432 INFO L87 Difference]: Start difference. First operand 482 states and 685 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 15:25:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:52,547 INFO L93 Difference]: Finished difference Result 1459 states and 2126 transitions. [2024-10-14 15:25:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:25:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-14 15:25:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:52,557 INFO L225 Difference]: With dead ends: 1459 [2024-10-14 15:25:52,557 INFO L226 Difference]: Without dead ends: 967 [2024-10-14 15:25:52,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:25:52,564 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 595 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:52,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 917 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 15:25:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-10-14 15:25:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 872. [2024-10-14 15:25:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 638 states have (on average 1.474921630094044) internal successors, (941), 654 states have internal predecessors, (941), 162 states have call successors, (162), 71 states have call predecessors, (162), 71 states have return successors, (166), 156 states have call predecessors, (166), 157 states have call successors, (166) [2024-10-14 15:25:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1269 transitions. [2024-10-14 15:25:52,648 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1269 transitions. Word has length 51 [2024-10-14 15:25:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:52,649 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1269 transitions. [2024-10-14 15:25:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 15:25:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1269 transitions. [2024-10-14 15:25:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 15:25:52,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:52,656 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:25:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 15:25:52,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:52,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 391098611, now seen corresponding path program 1 times [2024-10-14 15:25:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:52,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996994596] [2024-10-14 15:25:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 15:25:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 15:25:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:25:52,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996994596] [2024-10-14 15:25:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996994596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:52,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:25:52,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867285547] [2024-10-14 15:25:52,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:52,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:25:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:25:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:25:52,795 INFO L87 Difference]: Start difference. First operand 872 states and 1269 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:25:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:54,139 INFO L93 Difference]: Finished difference Result 2608 states and 3795 transitions. [2024-10-14 15:25:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 15:25:54,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2024-10-14 15:25:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:54,153 INFO L225 Difference]: With dead ends: 2608 [2024-10-14 15:25:54,154 INFO L226 Difference]: Without dead ends: 1753 [2024-10-14 15:25:54,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:25:54,161 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 868 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:54,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 996 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 15:25:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-10-14 15:25:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1548. [2024-10-14 15:25:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1137 states have (on average 1.4775725593667546) internal successors, (1680), 1165 states have internal predecessors, (1680), 283 states have call successors, (283), 130 states have call predecessors, (283), 127 states have return successors, (282), 272 states have call predecessors, (282), 278 states have call successors, (282) [2024-10-14 15:25:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2245 transitions. [2024-10-14 15:25:54,263 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2245 transitions. Word has length 64 [2024-10-14 15:25:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:54,281 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 2245 transitions. [2024-10-14 15:25:54,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:25:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2245 transitions. [2024-10-14 15:25:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 15:25:54,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:54,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-14 15:25:54,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 15:25:54,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:54,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -745711473, now seen corresponding path program 1 times [2024-10-14 15:25:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623052444] [2024-10-14 15:25:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 15:25:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 15:25:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:25:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623052444] [2024-10-14 15:25:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623052444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 15:25:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104763088] [2024-10-14 15:25:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:54,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:25:54,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:25:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:25:54,399 INFO L87 Difference]: Start difference. First operand 1548 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:25:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:55,600 INFO L93 Difference]: Finished difference Result 4700 states and 6816 transitions. [2024-10-14 15:25:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 15:25:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-10-14 15:25:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:55,615 INFO L225 Difference]: With dead ends: 4700 [2024-10-14 15:25:55,616 INFO L226 Difference]: Without dead ends: 3169 [2024-10-14 15:25:55,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 15:25:55,621 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 813 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:55,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 909 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 15:25:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2024-10-14 15:25:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 2800. [2024-10-14 15:25:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2054 states have (on average 1.4698149951314508) internal successors, (3019), 2106 states have internal predecessors, (3019), 508 states have call successors, (508), 238 states have call predecessors, (508), 237 states have return successors, (511), 491 states have call predecessors, (511), 503 states have call successors, (511) [2024-10-14 15:25:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 4038 transitions. [2024-10-14 15:25:55,798 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 4038 transitions. Word has length 67 [2024-10-14 15:25:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:55,800 INFO L471 AbstractCegarLoop]: Abstraction has 2800 states and 4038 transitions. [2024-10-14 15:25:55,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:25:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 4038 transitions. [2024-10-14 15:25:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 15:25:55,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:55,810 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-14 15:25:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 15:25:55,811 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:55,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1174157146, now seen corresponding path program 1 times [2024-10-14 15:25:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:55,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631984225] [2024-10-14 15:25:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:55,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 15:25:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 15:25:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 15:25:56,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631984225] [2024-10-14 15:25:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631984225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:56,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:25:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975369150] [2024-10-14 15:25:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:56,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:25:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:25:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:25:56,034 INFO L87 Difference]: Start difference. First operand 2800 states and 4038 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:25:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:57,018 INFO L93 Difference]: Finished difference Result 5925 states and 8577 transitions. [2024-10-14 15:25:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 15:25:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2024-10-14 15:25:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:57,037 INFO L225 Difference]: With dead ends: 5925 [2024-10-14 15:25:57,037 INFO L226 Difference]: Without dead ends: 3142 [2024-10-14 15:25:57,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:25:57,046 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 280 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:57,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 990 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 15:25:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-10-14 15:25:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2808. [2024-10-14 15:25:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2062 states have (on average 1.467992240543162) internal successors, (3027), 2114 states have internal predecessors, (3027), 508 states have call successors, (508), 238 states have call predecessors, (508), 237 states have return successors, (511), 491 states have call predecessors, (511), 503 states have call successors, (511) [2024-10-14 15:25:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4046 transitions. [2024-10-14 15:25:57,203 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4046 transitions. Word has length 71 [2024-10-14 15:25:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:57,204 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 4046 transitions. [2024-10-14 15:25:57,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:25:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4046 transitions. [2024-10-14 15:25:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 15:25:57,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:57,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-10-14 15:25:57,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 15:25:57,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -280670808, now seen corresponding path program 1 times [2024-10-14 15:25:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:57,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001260163] [2024-10-14 15:25:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 15:25:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 15:25:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 15:25:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:57,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001260163] [2024-10-14 15:25:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001260163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:57,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:57,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 15:25:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373191099] [2024-10-14 15:25:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:57,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:25:57,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:25:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:25:57,363 INFO L87 Difference]: Start difference. First operand 2808 states and 4046 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:25:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:25:58,409 INFO L93 Difference]: Finished difference Result 5957 states and 8609 transitions. [2024-10-14 15:25:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:25:58,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2024-10-14 15:25:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:25:58,430 INFO L225 Difference]: With dead ends: 5957 [2024-10-14 15:25:58,430 INFO L226 Difference]: Without dead ends: 3054 [2024-10-14 15:25:58,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:25:58,441 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 272 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 15:25:58,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1196 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 15:25:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2024-10-14 15:25:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2712. [2024-10-14 15:25:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2006 states have (on average 1.4690927218344965) internal successors, (2947), 2058 states have internal predecessors, (2947), 468 states have call successors, (468), 238 states have call predecessors, (468), 237 states have return successors, (471), 451 states have call predecessors, (471), 463 states have call successors, (471) [2024-10-14 15:25:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3886 transitions. [2024-10-14 15:25:58,635 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3886 transitions. Word has length 71 [2024-10-14 15:25:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:25:58,636 INFO L471 AbstractCegarLoop]: Abstraction has 2712 states and 3886 transitions. [2024-10-14 15:25:58,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:25:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3886 transitions. [2024-10-14 15:25:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 15:25:58,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:25:58,643 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 15:25:58,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 15:25:58,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:25:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:25:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1452525558, now seen corresponding path program 1 times [2024-10-14 15:25:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:25:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025871417] [2024-10-14 15:25:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:25:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:25:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:25:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:25:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:25:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:25:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:25:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 15:25:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 15:25:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 15:25:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:25:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 15:25:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:25:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:25:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:25:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025871417] [2024-10-14 15:25:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025871417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:25:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:25:58,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 15:25:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175164795] [2024-10-14 15:25:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:25:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 15:25:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:25:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 15:25:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:25:58,898 INFO L87 Difference]: Start difference. First operand 2712 states and 3886 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:01,140 INFO L93 Difference]: Finished difference Result 7398 states and 10691 transitions. [2024-10-14 15:26:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 15:26:01,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-10-14 15:26:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:01,165 INFO L225 Difference]: With dead ends: 7398 [2024-10-14 15:26:01,165 INFO L226 Difference]: Without dead ends: 4703 [2024-10-14 15:26:01,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-14 15:26:01,173 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 932 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:01,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1626 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 15:26:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2024-10-14 15:26:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4082. [2024-10-14 15:26:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 3040 states have (on average 1.461513157894737) internal successors, (4443), 3120 states have internal predecessors, (4443), 687 states have call successors, (687), 353 states have call predecessors, (687), 354 states have return successors, (694), 664 states have call predecessors, (694), 682 states have call successors, (694) [2024-10-14 15:26:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5824 transitions. [2024-10-14 15:26:01,516 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5824 transitions. Word has length 113 [2024-10-14 15:26:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:01,516 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 5824 transitions. [2024-10-14 15:26:01,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5824 transitions. [2024-10-14 15:26:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 15:26:01,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:01,522 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-14 15:26:01,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 15:26:01,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1862294632, now seen corresponding path program 1 times [2024-10-14 15:26:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681278206] [2024-10-14 15:26:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:26:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:26:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 15:26:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 15:26:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 15:26:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 15:26:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 15:26:01,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681278206] [2024-10-14 15:26:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681278206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:26:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 15:26:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439940253] [2024-10-14 15:26:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:01,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:26:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:26:01,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:26:01,749 INFO L87 Difference]: Start difference. First operand 4082 states and 5824 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:03,655 INFO L93 Difference]: Finished difference Result 11119 states and 16006 transitions. [2024-10-14 15:26:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 15:26:03,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-14 15:26:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:03,689 INFO L225 Difference]: With dead ends: 11119 [2024-10-14 15:26:03,689 INFO L226 Difference]: Without dead ends: 7054 [2024-10-14 15:26:03,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-14 15:26:03,701 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 923 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:03,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 1083 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 15:26:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2024-10-14 15:26:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6143. [2024-10-14 15:26:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6143 states, 4606 states have (on average 1.4537559704732956) internal successors, (6696), 4728 states have internal predecessors, (6696), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1021), 976 states have call predecessors, (1021), 1003 states have call successors, (1021) [2024-10-14 15:26:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 8725 transitions. [2024-10-14 15:26:04,097 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 8725 transitions. Word has length 116 [2024-10-14 15:26:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:04,097 INFO L471 AbstractCegarLoop]: Abstraction has 6143 states and 8725 transitions. [2024-10-14 15:26:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 8725 transitions. [2024-10-14 15:26:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 15:26:04,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:04,104 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-10-14 15:26:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 15:26:04,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1553431598, now seen corresponding path program 1 times [2024-10-14 15:26:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:04,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453608004] [2024-10-14 15:26:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:26:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:26:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 15:26:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 15:26:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 15:26:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 15:26:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 15:26:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453608004] [2024-10-14 15:26:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453608004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:26:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953584438] [2024-10-14 15:26:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:04,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:26:04,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:26:04,397 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) [2024-10-14 15:26:04,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 15:26:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:04,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 15:26:04,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:26:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 15:26:04,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:26:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953584438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:04,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:26:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 15:26:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842837958] [2024-10-14 15:26:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:26:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:26:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 15:26:04,838 INFO L87 Difference]: Start difference. First operand 6143 states and 8725 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:26:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:05,292 INFO L93 Difference]: Finished difference Result 12377 states and 17592 transitions. [2024-10-14 15:26:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:26:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 122 [2024-10-14 15:26:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:05,325 INFO L225 Difference]: With dead ends: 12377 [2024-10-14 15:26:05,325 INFO L226 Difference]: Without dead ends: 6089 [2024-10-14 15:26:05,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 15:26:05,339 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:05,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1521 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:26:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2024-10-14 15:26:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 6089. [2024-10-14 15:26:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6089 states, 4552 states have (on average 1.4512302284710017) internal successors, (6606), 4683 states have internal predecessors, (6606), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 967 states have call predecessors, (1012), 994 states have call successors, (1012) [2024-10-14 15:26:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 8626 transitions. [2024-10-14 15:26:05,814 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 8626 transitions. Word has length 122 [2024-10-14 15:26:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:05,815 INFO L471 AbstractCegarLoop]: Abstraction has 6089 states and 8626 transitions. [2024-10-14 15:26:05,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:26:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 8626 transitions. [2024-10-14 15:26:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 15:26:05,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:05,823 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-10-14 15:26:05,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 15:26:06,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 15:26:06,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:06,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash 880872378, now seen corresponding path program 1 times [2024-10-14 15:26:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:06,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618667655] [2024-10-14 15:26:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:06,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:26:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:26:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 15:26:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 15:26:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 15:26:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 15:26:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 15:26:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618667655] [2024-10-14 15:26:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618667655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:26:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 15:26:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700301663] [2024-10-14 15:26:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:06,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 15:26:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 15:26:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:26:06,270 INFO L87 Difference]: Start difference. First operand 6089 states and 8626 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:26:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:07,724 INFO L93 Difference]: Finished difference Result 13013 states and 18537 transitions. [2024-10-14 15:26:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:26:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2024-10-14 15:26:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:07,755 INFO L225 Difference]: With dead ends: 13013 [2024-10-14 15:26:07,755 INFO L226 Difference]: Without dead ends: 6941 [2024-10-14 15:26:07,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 15:26:07,768 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 753 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 895 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 15:26:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2024-10-14 15:26:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 6071. [2024-10-14 15:26:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6071 states, 4534 states have (on average 1.4450816056462286) internal successors, (6552), 4665 states have internal predecessors, (6552), 1008 states have call successors, (1008), 524 states have call predecessors, (1008), 528 states have return successors, (1012), 967 states have call predecessors, (1012), 994 states have call successors, (1012) [2024-10-14 15:26:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 8572 transitions. [2024-10-14 15:26:08,280 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 8572 transitions. Word has length 123 [2024-10-14 15:26:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:08,282 INFO L471 AbstractCegarLoop]: Abstraction has 6071 states and 8572 transitions. [2024-10-14 15:26:08,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:26:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 8572 transitions. [2024-10-14 15:26:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 15:26:08,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:08,291 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:26:08,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 15:26:08,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -249665152, now seen corresponding path program 1 times [2024-10-14 15:26:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142352759] [2024-10-14 15:26:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:26:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:26:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 15:26:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 15:26:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 15:26:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 15:26:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 15:26:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142352759] [2024-10-14 15:26:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142352759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:26:08,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174157777] [2024-10-14 15:26:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:26:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:26:08,563 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) [2024-10-14 15:26:08,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 15:26:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:08,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 15:26:08,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:26:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 15:26:08,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:26:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174157777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:08,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:26:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-10-14 15:26:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246746804] [2024-10-14 15:26:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:09,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:26:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:26:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:26:09,001 INFO L87 Difference]: Start difference. First operand 6071 states and 8572 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 15:26:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:10,491 INFO L93 Difference]: Finished difference Result 18154 states and 25645 transitions. [2024-10-14 15:26:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 15:26:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 124 [2024-10-14 15:26:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:10,555 INFO L225 Difference]: With dead ends: 18154 [2024-10-14 15:26:10,555 INFO L226 Difference]: Without dead ends: 18123 [2024-10-14 15:26:10,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:26:10,564 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 739 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:10,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1321 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 15:26:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18123 states. [2024-10-14 15:26:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18123 to 18093. [2024-10-14 15:26:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18093 states, 13516 states have (on average 1.4465078425569695) internal successors, (19551), 13909 states have internal predecessors, (19551), 3000 states have call successors, (3000), 1554 states have call predecessors, (3000), 1576 states have return successors, (3022), 2887 states have call predecessors, (3022), 2968 states have call successors, (3022) [2024-10-14 15:26:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18093 states to 18093 states and 25573 transitions. [2024-10-14 15:26:11,842 INFO L78 Accepts]: Start accepts. Automaton has 18093 states and 25573 transitions. Word has length 124 [2024-10-14 15:26:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:11,842 INFO L471 AbstractCegarLoop]: Abstraction has 18093 states and 25573 transitions. [2024-10-14 15:26:11,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 15:26:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 18093 states and 25573 transitions. [2024-10-14 15:26:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 15:26:11,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:11,861 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-14 15:26:11,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 15:26:12,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 15:26:12,063 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2025603510, now seen corresponding path program 1 times [2024-10-14 15:26:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366232550] [2024-10-14 15:26:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:26:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:26:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 15:26:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 15:26:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 15:26:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 15:26:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 15:26:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366232550] [2024-10-14 15:26:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366232550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:26:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 15:26:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915137743] [2024-10-14 15:26:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 15:26:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 15:26:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:26:12,282 INFO L87 Difference]: Start difference. First operand 18093 states and 25573 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:26:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:13,748 INFO L93 Difference]: Finished difference Result 24097 states and 34218 transitions. [2024-10-14 15:26:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 15:26:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2024-10-14 15:26:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:13,779 INFO L225 Difference]: With dead ends: 24097 [2024-10-14 15:26:13,780 INFO L226 Difference]: Without dead ends: 5847 [2024-10-14 15:26:13,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 15:26:13,820 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 559 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:13,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1203 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 15:26:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2024-10-14 15:26:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5691. [2024-10-14 15:26:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5691 states, 4423 states have (on average 1.4623558670585575) internal successors, (6468), 4537 states have internal predecessors, (6468), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 790 states have call predecessors, (799), 799 states have call successors, (799) [2024-10-14 15:26:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5691 states to 5691 states and 8071 transitions. [2024-10-14 15:26:14,373 INFO L78 Accepts]: Start accepts. Automaton has 5691 states and 8071 transitions. Word has length 129 [2024-10-14 15:26:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:14,375 INFO L471 AbstractCegarLoop]: Abstraction has 5691 states and 8071 transitions. [2024-10-14 15:26:14,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 15:26:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5691 states and 8071 transitions. [2024-10-14 15:26:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 15:26:14,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:14,391 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-10-14 15:26:14,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 15:26:14,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:14,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1039834887, now seen corresponding path program 1 times [2024-10-14 15:26:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395773182] [2024-10-14 15:26:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 15:26:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 15:26:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 15:26:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 15:26:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 15:26:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 15:26:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-14 15:26:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:14,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395773182] [2024-10-14 15:26:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395773182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:26:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 15:26:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281760667] [2024-10-14 15:26:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:14,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 15:26:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:14,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 15:26:14,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:26:14,741 INFO L87 Difference]: Start difference. First operand 5691 states and 8071 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:16,370 INFO L93 Difference]: Finished difference Result 11557 states and 16422 transitions. [2024-10-14 15:26:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:26:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2024-10-14 15:26:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:16,403 INFO L225 Difference]: With dead ends: 11557 [2024-10-14 15:26:16,403 INFO L226 Difference]: Without dead ends: 5883 [2024-10-14 15:26:16,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 15:26:16,418 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 408 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:16,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1010 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 15:26:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2024-10-14 15:26:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 5694. [2024-10-14 15:26:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 4426 states have (on average 1.4620424762765476) internal successors, (6471), 4540 states have internal predecessors, (6471), 804 states have call successors, (804), 468 states have call predecessors, (804), 463 states have return successors, (799), 790 states have call predecessors, (799), 799 states have call successors, (799) [2024-10-14 15:26:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 8074 transitions. [2024-10-14 15:26:16,978 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 8074 transitions. Word has length 132 [2024-10-14 15:26:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 8074 transitions. [2024-10-14 15:26:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 8074 transitions. [2024-10-14 15:26:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 15:26:16,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:26:16,993 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:26:16,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 15:26:16,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:26:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:26:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1758268219, now seen corresponding path program 1 times [2024-10-14 15:26:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:26:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484217481] [2024-10-14 15:26:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:26:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:26:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 15:26:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 15:26:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:26:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 15:26:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 15:26:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 15:26:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 15:26:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 15:26:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:26:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 15:26:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:26:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-14 15:26:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:26:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484217481] [2024-10-14 15:26:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484217481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:26:17,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:26:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 15:26:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010823022] [2024-10-14 15:26:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:26:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 15:26:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:26:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 15:26:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:26:17,432 INFO L87 Difference]: Start difference. First operand 5694 states and 8074 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:26:18,513 INFO L93 Difference]: Finished difference Result 6353 states and 8975 transitions. [2024-10-14 15:26:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 15:26:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2024-10-14 15:26:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:26:18,521 INFO L225 Difference]: With dead ends: 6353 [2024-10-14 15:26:18,521 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 15:26:18,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-14 15:26:18,531 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 595 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 15:26:18,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 513 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 15:26:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 15:26:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 15:26:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 15:26:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 15:26:18,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2024-10-14 15:26:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:26:18,541 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 15:26:18,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 15:26:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 15:26:18,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 15:26:18,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 15:26:18,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 15:26:18,547 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:26:18,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 15:26:41,069 WARN L286 SmtUtils]: Spent 22.45s on a formula simplification. DAG size of input: 103 DAG size of output: 87 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-14 15:27:02,491 WARN L286 SmtUtils]: Spent 21.42s on a formula simplification. DAG size of input: 105 DAG size of output: 96 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)