./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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.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 be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 08:01:36,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 08:01:36,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 08:01:36,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 08:01:36,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 08:01:36,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 08:01:36,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 08:01:36,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 08:01:36,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 08:01:36,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 08:01:36,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 08:01:36,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 08:01:36,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 08:01:36,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 08:01:36,992 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 08:01:36,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 08:01:36,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 08:01:36,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 08:01:36,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 08:01:36,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 08:01:36,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 08:01:36,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 08:01:36,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 08:01:36,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 08:01:36,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 08:01:36,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 08:01:36,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 08:01:36,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 08:01:36,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 08:01:36,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 08:01:36,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 08:01:37,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 08:01:37,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 08:01:37,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 08:01:37,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 08:01:37,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 08:01:37,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 08:01:37,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 08:01:37,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 08:01:37,001 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 -> be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 [2024-10-13 08:01:37,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 08:01:37,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 08:01:37,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 08:01:37,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 08:01:37,245 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 08:01:37,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2024-10-13 08:01:38,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 08:01:38,858 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 08:01:38,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2024-10-13 08:01:38,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27460e563/93285b24a74e40c8956a88cfee2716df/FLAGf74a4e497 [2024-10-13 08:01:39,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27460e563/93285b24a74e40c8956a88cfee2716df [2024-10-13 08:01:39,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 08:01:39,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 08:01:39,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 08:01:39,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 08:01:39,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 08:01:39,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:01:39" (1/1) ... [2024-10-13 08:01:39,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7676a5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:39, skipping insertion in model container [2024-10-13 08:01:39,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:01:39" (1/1) ... [2024-10-13 08:01:39,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 08:01:39,710 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2024-10-13 08:01:40,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 08:01:40,030 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 08:01:40,107 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5441] [2024-10-13 08:01:40,109 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5448] [2024-10-13 08:01:40,111 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; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5456-5457] [2024-10-13 08:01:40,113 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)); [5485] [2024-10-13 08:01:40,113 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; decl %0": "+m" (v->counter)); [5492] [2024-10-13 08:01:40,124 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2024-10-13 08:01:40,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6225/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/ems_usb.o.c.prepared"), "i" (546), "i" (12UL)); [6159-6160] [2024-10-13 08:01:40,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 08:01:40,310 INFO L204 MainTranslator]: Completed translation [2024-10-13 08:01:40,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40 WrapperNode [2024-10-13 08:01:40,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 08:01:40,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 08:01:40,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 08:01:40,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 08:01:40,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,439 INFO L138 Inliner]: procedures = 169, calls = 760, calls flagged for inlining = 78, calls inlined = 78, statements flattened = 2292 [2024-10-13 08:01:40,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 08:01:40,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 08:01:40,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 08:01:40,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 08:01:40,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,689 INFO L175 MemorySlicer]: Split 446 memory accesses to 8 slices as follows [9, 2, 42, 336, 20, 9, 20, 8]. 75 percent of accesses are in the largest equivalence class. The 140 initializations are split as follows [0, 2, 42, 88, 0, 0, 0, 8]. The 120 writes are split as follows [5, 0, 0, 104, 11, 0, 0, 0]. [2024-10-13 08:01:40,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 08:01:40,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 08:01:40,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 08:01:40,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 08:01:40,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (1/1) ... [2024-10-13 08:01:40,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 08:01:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 08:01:40,847 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-13 08:01:40,849 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-13 08:01:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-13 08:01:40,887 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_18 [2024-10-13 08:01:40,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_18 [2024-10-13 08:01:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2024-10-13 08:01:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2024-10-13 08:01:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2024-10-13 08:01:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2024-10-13 08:01:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2024-10-13 08:01:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2024-10-13 08:01:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-13 08:01:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-13 08:01:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-13 08:01:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-13 08:01:40,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-13 08:01:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-13 08:01:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-13 08:01:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-13 08:01:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-13 08:01:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-13 08:01:40,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-13 08:01:40,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-13 08:01:40,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-13 08:01:40,894 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-13 08:01:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_bulk_callback [2024-10-13 08:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_bulk_callback [2024-10-13 08:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2024-10-13 08:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2024-10-13 08:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2024-10-13 08:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2024-10-13 08:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2024-10-13 08:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2024-10-13 08:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2024-10-13 08:01:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2024-10-13 08:01:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-13 08:01:40,896 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-13 08:01:40,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-13 08:01:40,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-13 08:01:40,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-13 08:01:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 08:01:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 08:01:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-13 08:01:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-13 08:01:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2024-10-13 08:01:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2024-10-13 08:01:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 08:01:40,898 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2024-10-13 08:01:40,898 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2024-10-13 08:01:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2024-10-13 08:01:40,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2024-10-13 08:01:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-10-13 08:01:40,900 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-10-13 08:01:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 08:01:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-13 08:01:40,900 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-13 08:01:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-13 08:01:40,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-13 08:01:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 08:01:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 08:01:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 08:01:40,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 08:01:40,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 08:01:40,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 08:01:40,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 08:01:40,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-13 08:01:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-13 08:01:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2024-10-13 08:01:40,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2024-10-13 08:01:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 08:01:40,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 08:01:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-13 08:01:40,903 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-13 08:01:40,903 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-13 08:01:40,903 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-13 08:01:40,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 08:01:40,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 08:01:40,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 08:01:40,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_disconnect [2024-10-13 08:01:40,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_disconnect [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-13 08:01:40,904 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-13 08:01:40,904 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2024-10-13 08:01:40,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2024-10-13 08:01:40,905 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_interrupt_callback [2024-10-13 08:01:40,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_interrupt_callback [2024-10-13 08:01:40,905 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-13 08:01:40,905 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-13 08:01:40,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 08:01:40,905 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-10-13 08:01:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-10-13 08:01:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 08:01:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 08:01:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 08:01:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 08:01:40,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 08:01:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 08:01:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-13 08:01:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-13 08:01:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_rx_err [2024-10-13 08:01:40,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_rx_err [2024-10-13 08:01:40,907 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-13 08:01:40,907 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-13 08:01:40,908 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2024-10-13 08:01:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2024-10-13 08:01:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2024-10-13 08:01:40,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2024-10-13 08:01:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-13 08:01:40,909 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-13 08:01:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 08:01:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 08:01:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 08:01:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 08:01:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 08:01:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 08:01:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-13 08:01:40,911 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-13 08:01:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-13 08:01:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-13 08:01:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-13 08:01:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-13 08:01:40,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-13 08:01:40,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 08:01:40,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 08:01:41,294 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 08:01:41,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 08:01:41,363 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-13 08:01:41,801 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2024-10-13 08:01:43,517 INFO L? ?]: Removed 985 outVars from TransFormulas that were not future-live. [2024-10-13 08:01:43,517 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 08:01:43,636 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 08:01:43,636 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 08:01:43,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:01:43 BoogieIcfgContainer [2024-10-13 08:01:43,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 08:01:43,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 08:01:43,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 08:01:43,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 08:01:43,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:01:39" (1/3) ... [2024-10-13 08:01:43,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e45d406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:01:43, skipping insertion in model container [2024-10-13 08:01:43,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:40" (2/3) ... [2024-10-13 08:01:43,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e45d406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:01:43, skipping insertion in model container [2024-10-13 08:01:43,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:01:43" (3/3) ... [2024-10-13 08:01:43,645 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2024-10-13 08:01:43,657 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 08:01:43,658 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 08:01:43,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 08:01:43,738 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;@53829fc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 08:01:43,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 08:01:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 672 states, 463 states have (on average 1.42548596112311) internal successors, (660), 489 states have internal predecessors, (660), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) [2024-10-13 08:01:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 08:01:43,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:43,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:01:43,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:43,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1533492630, now seen corresponding path program 1 times [2024-10-13 08:01:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664650201] [2024-10-13 08:01:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 08:01:44,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664650201] [2024-10-13 08:01:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664650201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:44,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46145645] [2024-10-13 08:01:44,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:44,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:44,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:44,443 INFO L87 Difference]: Start difference. First operand has 672 states, 463 states have (on average 1.42548596112311) internal successors, (660), 489 states have internal predecessors, (660), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 08:01:49,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 08:01:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:01:49,481 INFO L93 Difference]: Finished difference Result 2137 states and 3192 transitions. [2024-10-13 08:01:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 08:01:49,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-13 08:01:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:01:49,511 INFO L225 Difference]: With dead ends: 2137 [2024-10-13 08:01:49,511 INFO L226 Difference]: Without dead ends: 1447 [2024-10-13 08:01:49,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-13 08:01:49,525 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 1295 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-13 08:01:49,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 1759 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-13 08:01:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-10-13 08:01:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1297. [2024-10-13 08:01:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 905 states have (on average 1.3734806629834253) internal successors, (1243), 937 states have internal predecessors, (1243), 293 states have call successors, (293), 99 states have call predecessors, (293), 98 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-13 08:01:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1824 transitions. [2024-10-13 08:01:49,666 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1824 transitions. Word has length 23 [2024-10-13 08:01:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:01:49,666 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1824 transitions. [2024-10-13 08:01:49,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 08:01:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1824 transitions. [2024-10-13 08:01:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 08:01:49,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:49,671 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] [2024-10-13 08:01:49,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 08:01:49,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:49,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 995292954, now seen corresponding path program 1 times [2024-10-13 08:01:49,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:49,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776801012] [2024-10-13 08:01:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:01:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:50,133 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-13 08:01:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776801012] [2024-10-13 08:01:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776801012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125108567] [2024-10-13 08:01:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:50,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:50,139 INFO L87 Difference]: Start difference. First operand 1297 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:01:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:01:53,466 INFO L93 Difference]: Finished difference Result 4180 states and 6087 transitions. [2024-10-13 08:01:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 08:01:53,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-13 08:01:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:01:53,493 INFO L225 Difference]: With dead ends: 4180 [2024-10-13 08:01:53,493 INFO L226 Difference]: Without dead ends: 2888 [2024-10-13 08:01:53,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-13 08:01:53,499 INFO L432 NwaCegarLoop]: 1117 mSDtfsCounter, 1149 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 08:01:53,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 2329 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 08:01:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-13 08:01:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2692. [2024-10-13 08:01:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 1882 states have (on average 1.3719447396386824) internal successors, (2582), 1954 states have internal predecessors, (2582), 599 states have call successors, (599), 197 states have call predecessors, (599), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-13 08:01:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3851 transitions. [2024-10-13 08:01:53,616 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3851 transitions. Word has length 32 [2024-10-13 08:01:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:01:53,616 INFO L471 AbstractCegarLoop]: Abstraction has 2692 states and 3851 transitions. [2024-10-13 08:01:53,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:01:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3851 transitions. [2024-10-13 08:01:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 08:01:53,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:53,621 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] [2024-10-13 08:01:53,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 08:01:53,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:53,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:53,622 INFO L85 PathProgramCache]: Analyzing trace with hash 788982468, now seen corresponding path program 1 times [2024-10-13 08:01:53,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:53,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388237534] [2024-10-13 08:01:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:01:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,933 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-13 08:01:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388237534] [2024-10-13 08:01:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388237534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114720728] [2024-10-13 08:01:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:53,941 INFO L87 Difference]: Start difference. First operand 2692 states and 3851 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:01:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:01:56,586 INFO L93 Difference]: Finished difference Result 2880 states and 4184 transitions. [2024-10-13 08:01:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:01:56,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-13 08:01:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:01:56,600 INFO L225 Difference]: With dead ends: 2880 [2024-10-13 08:01:56,601 INFO L226 Difference]: Without dead ends: 2877 [2024-10-13 08:01:56,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-13 08:01:56,604 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 1063 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 08:01:56,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1083 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 08:01:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2024-10-13 08:01:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2691. [2024-10-13 08:01:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 1882 states have (on average 1.371413390010627) internal successors, (2581), 1953 states have internal predecessors, (2581), 598 states have call successors, (598), 197 states have call predecessors, (598), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-13 08:01:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3849 transitions. [2024-10-13 08:01:56,721 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3849 transitions. Word has length 33 [2024-10-13 08:01:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:01:56,722 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3849 transitions. [2024-10-13 08:01:56,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:01:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3849 transitions. [2024-10-13 08:01:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 08:01:56,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:56,724 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] [2024-10-13 08:01:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 08:01:56,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1311670435, now seen corresponding path program 1 times [2024-10-13 08:01:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46520559] [2024-10-13 08:01:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:01:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:56,861 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-13 08:01:56,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:56,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46520559] [2024-10-13 08:01:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46520559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741062625] [2024-10-13 08:01:56,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:56,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:56,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:56,863 INFO L87 Difference]: Start difference. First operand 2691 states and 3849 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:01:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:01:58,584 INFO L93 Difference]: Finished difference Result 2879 states and 4182 transitions. [2024-10-13 08:01:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:01:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-10-13 08:01:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:01:58,595 INFO L225 Difference]: With dead ends: 2879 [2024-10-13 08:01:58,595 INFO L226 Difference]: Without dead ends: 2876 [2024-10-13 08:01:58,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-13 08:01:58,597 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 1061 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 08:01:58,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1078 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 08:01:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-10-13 08:01:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2690. [2024-10-13 08:01:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 1882 states have (on average 1.3708820403825717) internal successors, (2580), 1952 states have internal predecessors, (2580), 597 states have call successors, (597), 197 states have call predecessors, (597), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-13 08:01:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3847 transitions. [2024-10-13 08:01:58,693 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3847 transitions. Word has length 34 [2024-10-13 08:01:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:01:58,693 INFO L471 AbstractCegarLoop]: Abstraction has 2690 states and 3847 transitions. [2024-10-13 08:01:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:01:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3847 transitions. [2024-10-13 08:01:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 08:01:58,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:58,695 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] [2024-10-13 08:01:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 08:01:58,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:58,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2007396121, now seen corresponding path program 1 times [2024-10-13 08:01:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705679844] [2024-10-13 08:01:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:01:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:58,821 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-13 08:01:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:58,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705679844] [2024-10-13 08:01:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705679844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:58,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732930318] [2024-10-13 08:01:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:58,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:58,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:58,824 INFO L87 Difference]: Start difference. First operand 2690 states and 3847 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:01,213 INFO L93 Difference]: Finished difference Result 2878 states and 4180 transitions. [2024-10-13 08:02:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-13 08:02:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:01,225 INFO L225 Difference]: With dead ends: 2878 [2024-10-13 08:02:01,225 INFO L226 Difference]: Without dead ends: 2875 [2024-10-13 08:02:01,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-13 08:02:01,226 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 1056 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:01,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1078 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 08:02:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2024-10-13 08:02:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2689. [2024-10-13 08:02:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 1882 states have (on average 1.3703506907545164) internal successors, (2579), 1951 states have internal predecessors, (2579), 596 states have call successors, (596), 197 states have call predecessors, (596), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-13 08:02:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3845 transitions. [2024-10-13 08:02:01,328 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3845 transitions. Word has length 35 [2024-10-13 08:02:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:01,329 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 3845 transitions. [2024-10-13 08:02:01,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3845 transitions. [2024-10-13 08:02:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 08:02:01,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:01,331 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] [2024-10-13 08:02:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 08:02:01,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2100051040, now seen corresponding path program 1 times [2024-10-13 08:02:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929678140] [2024-10-13 08:02:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,479 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-13 08:02:01,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929678140] [2024-10-13 08:02:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929678140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:01,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:02:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447742199] [2024-10-13 08:02:01,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:01,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:02:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:02:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:02:01,482 INFO L87 Difference]: Start difference. First operand 2689 states and 3845 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:05,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 08:02:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:05,620 INFO L93 Difference]: Finished difference Result 2877 states and 4178 transitions. [2024-10-13 08:02:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-13 08:02:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:05,632 INFO L225 Difference]: With dead ends: 2877 [2024-10-13 08:02:05,632 INFO L226 Difference]: Without dead ends: 2868 [2024-10-13 08:02:05,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-13 08:02:05,635 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 1059 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:05,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1067 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 08:02:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2024-10-13 08:02:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2682. [2024-10-13 08:02:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 1876 states have (on average 1.3694029850746268) internal successors, (2569), 1944 states have internal predecessors, (2569), 595 states have call successors, (595), 197 states have call predecessors, (595), 210 states have return successors, (670), 582 states have call predecessors, (670), 594 states have call successors, (670) [2024-10-13 08:02:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3834 transitions. [2024-10-13 08:02:05,762 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 3834 transitions. Word has length 36 [2024-10-13 08:02:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:05,762 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 3834 transitions. [2024-10-13 08:02:05,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 3834 transitions. [2024-10-13 08:02:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 08:02:05,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:05,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:05,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 08:02:05,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:05,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -807648992, now seen corresponding path program 1 times [2024-10-13 08:02:05,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674973199] [2024-10-13 08:02:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 08:02:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 08:02:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 08:02:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 08:02:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 08:02:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:05,973 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-13 08:02:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674973199] [2024-10-13 08:02:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674973199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802432724] [2024-10-13 08:02:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:05,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:05,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:05,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:05,977 INFO L87 Difference]: Start difference. First operand 2682 states and 3834 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 08:02:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:09,002 INFO L93 Difference]: Finished difference Result 6406 states and 9171 transitions. [2024-10-13 08:02:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 08:02:09,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2024-10-13 08:02:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:09,017 INFO L225 Difference]: With dead ends: 6406 [2024-10-13 08:02:09,018 INFO L226 Difference]: Without dead ends: 3729 [2024-10-13 08:02:09,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-13 08:02:09,025 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 1024 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:09,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1762 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 08:02:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-13 08:02:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3388. [2024-10-13 08:02:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 2350 states have (on average 1.3548936170212766) internal successors, (3184), 2432 states have internal predecessors, (3184), 734 states have call successors, (734), 276 states have call predecessors, (734), 303 states have return successors, (847), 727 states have call predecessors, (847), 733 states have call successors, (847) [2024-10-13 08:02:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4765 transitions. [2024-10-13 08:02:09,230 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4765 transitions. Word has length 77 [2024-10-13 08:02:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:09,230 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4765 transitions. [2024-10-13 08:02:09,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 08:02:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4765 transitions. [2024-10-13 08:02:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 08:02:09,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:09,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:09,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 08:02:09,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:09,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash -686984246, now seen corresponding path program 1 times [2024-10-13 08:02:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834349541] [2024-10-13 08:02:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:09,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 08:02:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 08:02:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 08:02:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 08:02:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 08:02:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834349541] [2024-10-13 08:02:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834349541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326000455] [2024-10-13 08:02:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:09,477 INFO L87 Difference]: Start difference. First operand 3388 states and 4765 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 08:02:14,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 08:02:17,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 08:02:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:18,904 INFO L93 Difference]: Finished difference Result 7878 states and 11135 transitions. [2024-10-13 08:02:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 08:02:18,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-10-13 08:02:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:18,923 INFO L225 Difference]: With dead ends: 7878 [2024-10-13 08:02:18,924 INFO L226 Difference]: Without dead ends: 4501 [2024-10-13 08:02:18,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-13 08:02:18,934 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 686 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:18,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2766 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-10-13 08:02:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2024-10-13 08:02:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4118. [2024-10-13 08:02:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4118 states, 2856 states have (on average 1.346638655462185) internal successors, (3846), 2952 states have internal predecessors, (3846), 872 states have call successors, (872), 354 states have call predecessors, (872), 389 states have return successors, (1005), 867 states have call predecessors, (1005), 871 states have call successors, (1005) [2024-10-13 08:02:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 5723 transitions. [2024-10-13 08:02:19,175 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 5723 transitions. Word has length 89 [2024-10-13 08:02:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:19,176 INFO L471 AbstractCegarLoop]: Abstraction has 4118 states and 5723 transitions. [2024-10-13 08:02:19,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 08:02:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 5723 transitions. [2024-10-13 08:02:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 08:02:19,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:19,179 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:19,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 08:02:19,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1790961661, now seen corresponding path program 1 times [2024-10-13 08:02:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606827033] [2024-10-13 08:02:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 08:02:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 08:02:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 08:02:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 08:02:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 08:02:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 08:02:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 08:02:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 08:02:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 08:02:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 08:02:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 08:02:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606827033] [2024-10-13 08:02:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606827033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 08:02:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357948253] [2024-10-13 08:02:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 08:02:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 08:02:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 08:02:19,467 INFO L87 Difference]: Start difference. First operand 4118 states and 5723 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 08:02:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:24,603 INFO L93 Difference]: Finished difference Result 12132 states and 17449 transitions. [2024-10-13 08:02:24,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 08:02:24,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-10-13 08:02:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:24,634 INFO L225 Difference]: With dead ends: 12132 [2024-10-13 08:02:24,634 INFO L226 Difference]: Without dead ends: 8025 [2024-10-13 08:02:24,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 08:02:24,649 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 1910 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 942 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:24,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 2895 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [942 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-13 08:02:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8025 states. [2024-10-13 08:02:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8025 to 7016. [2024-10-13 08:02:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 4925 states have (on average 1.36) internal successors, (6698), 5125 states have internal predecessors, (6698), 1448 states have call successors, (1448), 535 states have call predecessors, (1448), 642 states have return successors, (1835), 1467 states have call predecessors, (1835), 1447 states have call successors, (1835) [2024-10-13 08:02:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 9981 transitions. [2024-10-13 08:02:25,045 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 9981 transitions. Word has length 97 [2024-10-13 08:02:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:25,046 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 9981 transitions. [2024-10-13 08:02:25,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 08:02:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 9981 transitions. [2024-10-13 08:02:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 08:02:25,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:25,052 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2024-10-13 08:02:25,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 08:02:25,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:25,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1334245481, now seen corresponding path program 1 times [2024-10-13 08:02:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035284012] [2024-10-13 08:02:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 08:02:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 08:02:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 08:02:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 08:02:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035284012] [2024-10-13 08:02:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035284012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:25,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776083378] [2024-10-13 08:02:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:25,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:25,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:25,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:25,274 INFO L87 Difference]: Start difference. First operand 7016 states and 9981 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 08:02:34,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 08:02:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:37,032 INFO L93 Difference]: Finished difference Result 18778 states and 26867 transitions. [2024-10-13 08:02:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 08:02:37,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-10-13 08:02:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:37,077 INFO L225 Difference]: With dead ends: 18778 [2024-10-13 08:02:37,077 INFO L226 Difference]: Without dead ends: 11777 [2024-10-13 08:02:37,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-13 08:02:37,098 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 1539 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 736 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:37,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 2669 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 1458 Invalid, 1 Unknown, 0 Unchecked, 11.1s Time] [2024-10-13 08:02:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11777 states. [2024-10-13 08:02:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11777 to 10794. [2024-10-13 08:02:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10794 states, 7625 states have (on average 1.3635409836065573) internal successors, (10397), 7981 states have internal predecessors, (10397), 2084 states have call successors, (2084), 885 states have call predecessors, (2084), 1084 states have return successors, (2739), 2127 states have call predecessors, (2739), 2083 states have call successors, (2739) [2024-10-13 08:02:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10794 states to 10794 states and 15220 transitions. [2024-10-13 08:02:37,724 INFO L78 Accepts]: Start accepts. Automaton has 10794 states and 15220 transitions. Word has length 100 [2024-10-13 08:02:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:37,725 INFO L471 AbstractCegarLoop]: Abstraction has 10794 states and 15220 transitions. [2024-10-13 08:02:37,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 08:02:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 10794 states and 15220 transitions. [2024-10-13 08:02:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 08:02:37,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:37,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2024-10-13 08:02:37,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 08:02:37,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:37,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1706918023, now seen corresponding path program 1 times [2024-10-13 08:02:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551628869] [2024-10-13 08:02:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 08:02:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 08:02:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 08:02:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 08:02:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 08:02:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 08:02:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 08:02:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 08:02:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 08:02:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551628869] [2024-10-13 08:02:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551628869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:38,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 08:02:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054838088] [2024-10-13 08:02:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 08:02:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 08:02:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 08:02:38,178 INFO L87 Difference]: Start difference. First operand 10794 states and 15220 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 08:02:47,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 08:02:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:48,989 INFO L93 Difference]: Finished difference Result 23447 states and 33634 transitions. [2024-10-13 08:02:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 08:02:48,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-10-13 08:02:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:49,041 INFO L225 Difference]: With dead ends: 23447 [2024-10-13 08:02:49,041 INFO L226 Difference]: Without dead ends: 12668 [2024-10-13 08:02:49,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 08:02:49,071 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 576 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 463 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:49,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 3064 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 1985 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2024-10-13 08:02:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12668 states. [2024-10-13 08:02:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12668 to 10810. [2024-10-13 08:02:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10810 states, 7641 states have (on average 1.3627797408716136) internal successors, (10413), 7997 states have internal predecessors, (10413), 2084 states have call successors, (2084), 885 states have call predecessors, (2084), 1084 states have return successors, (2739), 2127 states have call predecessors, (2739), 2083 states have call successors, (2739) [2024-10-13 08:02:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10810 states to 10810 states and 15236 transitions. [2024-10-13 08:02:49,853 INFO L78 Accepts]: Start accepts. Automaton has 10810 states and 15236 transitions. Word has length 109 [2024-10-13 08:02:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:49,855 INFO L471 AbstractCegarLoop]: Abstraction has 10810 states and 15236 transitions. [2024-10-13 08:02:49,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 08:02:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10810 states and 15236 transitions. [2024-10-13 08:02:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 08:02:49,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:49,861 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2024-10-13 08:02:49,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 08:02:49,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1602126269, now seen corresponding path program 1 times [2024-10-13 08:02:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707909403] [2024-10-13 08:02:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 08:02:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 08:02:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 08:02:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 08:02:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 08:02:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 08:02:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 08:02:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 08:02:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 08:02:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707909403] [2024-10-13 08:02:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707909403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 08:02:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300469974] [2024-10-13 08:02:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:50,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 08:02:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 08:02:50,169 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-13 08:02:50,172 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-13 08:02:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:50,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 08:02:50,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 08:02:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 08:02:50,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 08:02:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 08:02:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300469974] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 08:02:50,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 08:02:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2024-10-13 08:02:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980441561] [2024-10-13 08:02:50,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 08:02:50,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 08:02:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 08:02:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 08:02:50,866 INFO L87 Difference]: Start difference. First operand 10810 states and 15236 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 08:02:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:56,025 INFO L93 Difference]: Finished difference Result 23511 states and 33730 transitions. [2024-10-13 08:02:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 08:02:56,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 110 [2024-10-13 08:02:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:56,078 INFO L225 Difference]: With dead ends: 23511 [2024-10-13 08:02:56,078 INFO L226 Difference]: Without dead ends: 12716 [2024-10-13 08:02:56,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 08:02:56,103 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 828 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:56,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2360 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 08:02:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2024-10-13 08:02:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 10858. [2024-10-13 08:02:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10858 states, 7689 states have (on average 1.3605150214592274) internal successors, (10461), 8045 states have internal predecessors, (10461), 2084 states have call successors, (2084), 885 states have call predecessors, (2084), 1084 states have return successors, (2739), 2127 states have call predecessors, (2739), 2083 states have call successors, (2739) [2024-10-13 08:02:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10858 states to 10858 states and 15284 transitions. [2024-10-13 08:02:56,881 INFO L78 Accepts]: Start accepts. Automaton has 10858 states and 15284 transitions. Word has length 110 [2024-10-13 08:02:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:56,882 INFO L471 AbstractCegarLoop]: Abstraction has 10858 states and 15284 transitions. [2024-10-13 08:02:56,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 08:02:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10858 states and 15284 transitions. [2024-10-13 08:02:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 08:02:56,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:56,888 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-13 08:02:56,906 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-13 08:02:57,089 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,SelfDestructingSolverStorable11 [2024-10-13 08:02:57,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:57,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1318002183, now seen corresponding path program 2 times [2024-10-13 08:02:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:57,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177353398] [2024-10-13 08:02:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 08:02:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 08:02:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 08:02:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 08:02:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 08:02:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 08:02:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 08:02:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 08:02:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-13 08:02:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177353398] [2024-10-13 08:02:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177353398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 08:02:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134564775] [2024-10-13 08:02:57,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 08:02:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 08:02:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 08:02:57,486 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-13 08:02:57,487 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-13 08:02:58,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 08:02:58,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 08:02:58,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 08:02:58,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 08:02:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 08:02:58,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 08:02:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 08:02:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134564775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 08:02:58,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 08:02:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-10-13 08:02:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807273827] [2024-10-13 08:02:58,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 08:02:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 08:02:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 08:02:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-13 08:02:58,399 INFO L87 Difference]: Start difference. First operand 10858 states and 15284 transitions. Second operand has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 14 states have internal predecessors, (127), 3 states have call successors, (35), 7 states have call predecessors, (35), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31)