./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.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 ef92dd0c18fa389aa454198685fbcc052698924a127f9f39b737e9548a23680b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 09:57:10,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 09:57:10,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 09:57:10,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 09:57:10,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 09:57:10,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 09:57:10,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 09:57:10,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 09:57:10,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 09:57:10,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 09:57:10,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 09:57:10,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 09:57:10,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 09:57:10,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 09:57:10,870 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 09:57:10,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 09:57:10,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 09:57:10,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 09:57:10,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 09:57:10,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 09:57:10,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 09:57:10,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 09:57:10,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 09:57:10,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 09:57:10,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 09:57:10,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 09:57:10,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 09:57:10,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 09:57:10,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 09:57:10,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 09:57:10,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 09:57:10,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 09:57:10,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 09:57:10,878 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 -> ef92dd0c18fa389aa454198685fbcc052698924a127f9f39b737e9548a23680b [2024-11-12 09:57:11,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 09:57:11,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 09:57:11,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 09:57:11,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 09:57:11,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 09:57:11,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i [2024-11-12 09:57:12,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 09:57:12,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 09:57:12,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i [2024-11-12 09:57:12,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c860d9c5/e451ba9ee99b44dfbd16ad170fc951fe/FLAG4cf974553 [2024-11-12 09:57:12,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c860d9c5/e451ba9ee99b44dfbd16ad170fc951fe [2024-11-12 09:57:12,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 09:57:12,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 09:57:12,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 09:57:12,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 09:57:12,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 09:57:12,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:57:12" (1/1) ... [2024-11-12 09:57:12,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d3d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:12, skipping insertion in model container [2024-11-12 09:57:12,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:57:12" (1/1) ... [2024-11-12 09:57:12,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 09:57:13,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i[160969,160982] [2024-11-12 09:57:13,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 09:57:13,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 09:57:13,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i[160969,160982] [2024-11-12 09:57:13,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 09:57:13,973 INFO L204 MainTranslator]: Completed translation [2024-11-12 09:57:13,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13 WrapperNode [2024-11-12 09:57:13,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 09:57:13,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 09:57:13,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 09:57:13,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 09:57:13,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,058 INFO L138 Inliner]: procedures = 101, calls = 399, calls flagged for inlining = 41, calls inlined = 38, statements flattened = 1059 [2024-11-12 09:57:14,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 09:57:14,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 09:57:14,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 09:57:14,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 09:57:14,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,179 INFO L175 MemorySlicer]: Split 259 memory accesses to 11 slices as follows [2, 2, 21, 7, 90, 19, 3, 44, 17, 33, 21]. 35 percent of accesses are in the largest equivalence class. The 78 initializations are split as follows [2, 0, 21, 7, 0, 0, 0, 0, 15, 33, 0]. The 113 writes are split as follows [0, 1, 0, 0, 29, 19, 1, 44, 1, 0, 18]. [2024-11-12 09:57:14,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 09:57:14,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 09:57:14,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 09:57:14,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 09:57:14,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (1/1) ... [2024-11-12 09:57:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 09:57:14,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 09:57:14,346 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-11-12 09:57:14,350 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-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-12 09:57:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-12 09:57:14,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-11-12 09:57:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-12 09:57:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2024-11-12 09:57:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-11-12 09:57:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-12 09:57:14,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-12 09:57:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2024-11-12 09:57:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-12 09:57:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2024-11-12 09:57:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2024-11-12 09:57:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-12 09:57:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-12 09:57:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 09:57:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 09:57:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 09:57:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-11-12 09:57:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2024-11-12 09:57:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 09:57:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 09:57:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 09:57:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-11-12 09:57:14,403 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-11-12 09:57:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-11-12 09:57:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-11-12 09:57:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-11-12 09:57:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-11-12 09:57:14,406 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-11-12 09:57:14,407 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 09:57:14,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2024-11-12 09:57:14,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-12 09:57:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_tx_fixup [2024-11-12 09:57:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_tx_fixup [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_rx_fixup [2024-11-12 09:57:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_rx_fixup [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 09:57:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-12 09:57:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2024-11-12 09:57:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 09:57:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 09:57:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 09:57:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 09:57:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 09:57:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-12 09:57:14,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-12 09:57:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-12 09:57:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-12 09:57:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-12 09:57:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-12 09:57:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-11-12 09:57:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-12 09:57:14,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-12 09:57:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 09:57:14,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 09:57:14,709 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 09:57:14,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 09:57:14,737 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-12 09:57:19,730 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-11-12 09:57:19,731 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 09:57:19,752 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 09:57:19,753 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 09:57:19,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:57:19 BoogieIcfgContainer [2024-11-12 09:57:19,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 09:57:19,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 09:57:19,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 09:57:19,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 09:57:19,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 09:57:12" (1/3) ... [2024-11-12 09:57:19,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fdd4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 09:57:19, skipping insertion in model container [2024-11-12 09:57:19,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:57:13" (2/3) ... [2024-11-12 09:57:19,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fdd4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 09:57:19, skipping insertion in model container [2024-11-12 09:57:19,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:57:19" (3/3) ... [2024-11-12 09:57:19,762 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--gl620a.ko-entry_point.cil.out.i [2024-11-12 09:57:19,778 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 09:57:19,778 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 09:57:19,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 09:57:19,859 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;@1fa4b0d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 09:57:19,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 09:57:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 204 states have (on average 1.392156862745098) internal successors, (284), 210 states have internal predecessors, (284), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 09:57:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 09:57:19,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:57:19,878 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 09:57:19,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:57:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:57:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1044850677, now seen corresponding path program 1 times [2024-11-12 09:57:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:57:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019752318] [2024-11-12 09:57:19,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:57:19,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:57:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:57:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:57:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:57:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:57:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 09:57:20,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:57:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019752318] [2024-11-12 09:57:20,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019752318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:57:20,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 09:57:20,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 09:57:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843298820] [2024-11-12 09:57:20,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:57:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 09:57:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:57:20,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 09:57:20,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 09:57:20,912 INFO L87 Difference]: Start difference. First operand has 260 states, 204 states have (on average 1.392156862745098) internal successors, (284), 210 states have internal predecessors, (284), 39 states have call successors, (39), 16 states have call predecessors, (39), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 09:57:24,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:57:28,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:57:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 09:57:30,860 INFO L93 Difference]: Finished difference Result 796 states and 1160 transitions. [2024-11-12 09:57:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 09:57:30,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-12 09:57:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 09:57:30,875 INFO L225 Difference]: With dead ends: 796 [2024-11-12 09:57:30,875 INFO L226 Difference]: Without dead ends: 525 [2024-11-12 09:57:30,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 09:57:30,882 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1059 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 362 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-12 09:57:30,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 688 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2024-11-12 09:57:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-12 09:57:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 457. [2024-11-12 09:57:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 368 states have (on average 1.3641304347826086) internal successors, (502), 368 states have internal predecessors, (502), 62 states have call successors, (62), 27 states have call predecessors, (62), 26 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-12 09:57:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 625 transitions. [2024-11-12 09:57:30,964 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 625 transitions. Word has length 42 [2024-11-12 09:57:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 09:57:30,965 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 625 transitions. [2024-11-12 09:57:30,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 09:57:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 625 transitions. [2024-11-12 09:57:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 09:57:30,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:57:30,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 09:57:30,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 09:57:30,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:57:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:57:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 338407271, now seen corresponding path program 1 times [2024-11-12 09:57:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:57:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511926005] [2024-11-12 09:57:30,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:57:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:57:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:57:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:57:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:57:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:57:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 09:57:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 09:57:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:57:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511926005] [2024-11-12 09:57:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511926005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:57:31,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 09:57:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 09:57:31,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818163574] [2024-11-12 09:57:31,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:57:31,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 09:57:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:57:31,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 09:57:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 09:57:31,532 INFO L87 Difference]: Start difference. First operand 457 states and 625 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 09:57:35,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:57:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 09:57:37,823 INFO L93 Difference]: Finished difference Result 1458 states and 2039 transitions. [2024-11-12 09:57:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 09:57:37,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-11-12 09:57:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 09:57:37,835 INFO L225 Difference]: With dead ends: 1458 [2024-11-12 09:57:37,836 INFO L226 Difference]: Without dead ends: 1015 [2024-11-12 09:57:37,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-12 09:57:37,841 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1076 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 354 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-12 09:57:37,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 929 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1059 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2024-11-12 09:57:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-12 09:57:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 885. [2024-11-12 09:57:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 715 states have (on average 1.3650349650349651) internal successors, (976), 715 states have internal predecessors, (976), 119 states have call successors, (119), 51 states have call predecessors, (119), 50 states have return successors, (124), 118 states have call predecessors, (124), 118 states have call successors, (124) [2024-11-12 09:57:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1219 transitions. [2024-11-12 09:57:37,921 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1219 transitions. Word has length 52 [2024-11-12 09:57:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 09:57:37,922 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1219 transitions. [2024-11-12 09:57:37,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 09:57:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1219 transitions. [2024-11-12 09:57:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-12 09:57:37,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:57:37,934 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 09:57:37,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 09:57:37,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:57:37,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:57:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1837690050, now seen corresponding path program 1 times [2024-11-12 09:57:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:57:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133265452] [2024-11-12 09:57:37,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:57:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:57:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:57:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:57:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:57:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:57:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 09:57:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:57:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 09:57:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 09:57:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 09:57:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 09:57:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-12 09:57:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:57:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133265452] [2024-11-12 09:57:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133265452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 09:57:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304653702] [2024-11-12 09:57:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:57:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 09:57:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 09:57:38,782 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-11-12 09:57:38,784 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-11-12 09:57:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:39,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 09:57:39,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 09:57:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-12 09:57:39,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 09:57:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304653702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:57:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 09:57:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-11-12 09:57:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5085593] [2024-11-12 09:57:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:57:39,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 09:57:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:57:39,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 09:57:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 09:57:39,431 INFO L87 Difference]: Start difference. First operand 885 states and 1219 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 09:57:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 09:57:39,532 INFO L93 Difference]: Finished difference Result 2028 states and 2833 transitions. [2024-11-12 09:57:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 09:57:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-12 09:57:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 09:57:39,538 INFO L225 Difference]: With dead ends: 2028 [2024-11-12 09:57:39,538 INFO L226 Difference]: Without dead ends: 1163 [2024-11-12 09:57:39,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 09:57:39,542 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 129 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 09:57:39,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 635 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 09:57:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-12 09:57:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1154. [2024-11-12 09:57:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 961 states have (on average 1.3912591050988554) internal successors, (1337), 961 states have internal predecessors, (1337), 132 states have call successors, (132), 61 states have call predecessors, (132), 60 states have return successors, (137), 131 states have call predecessors, (137), 131 states have call successors, (137) [2024-11-12 09:57:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1606 transitions. [2024-11-12 09:57:39,592 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1606 transitions. Word has length 126 [2024-11-12 09:57:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 09:57:39,594 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1606 transitions. [2024-11-12 09:57:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 09:57:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1606 transitions. [2024-11-12 09:57:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 09:57:39,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:57:39,599 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 09:57:39,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 09:57:39,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 09:57:39,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:57:39,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:57:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash -778974150, now seen corresponding path program 1 times [2024-11-12 09:57:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:57:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343339084] [2024-11-12 09:57:39,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:57:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:57:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:57:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:57:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:57:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:57:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 09:57:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 09:57:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 09:57:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 09:57:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:57:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 09:57:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 09:57:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 09:57:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:57:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:57:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 09:57:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:57:40,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343339084] [2024-11-12 09:57:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343339084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:57:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 09:57:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 09:57:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948892043] [2024-11-12 09:57:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:57:40,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 09:57:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:57:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 09:57:40,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 09:57:40,432 INFO L87 Difference]: Start difference. First operand 1154 states and 1606 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 09:57:44,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:57:48,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:57:52,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:57:56,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:00,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 09:58:03,257 INFO L93 Difference]: Finished difference Result 3378 states and 4718 transitions. [2024-11-12 09:58:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 09:58:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 148 [2024-11-12 09:58:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 09:58:03,271 INFO L225 Difference]: With dead ends: 3378 [2024-11-12 09:58:03,271 INFO L226 Difference]: Without dead ends: 2255 [2024-11-12 09:58:03,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-11-12 09:58:03,277 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1099 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 365 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-11-12 09:58:03,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1318 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 967 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2024-11-12 09:58:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2024-11-12 09:58:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1942. [2024-11-12 09:58:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1611 states have (on average 1.3761638733705772) internal successors, (2217), 1615 states have internal predecessors, (2217), 218 states have call successors, (218), 105 states have call predecessors, (218), 112 states have return successors, (237), 221 states have call predecessors, (237), 217 states have call successors, (237) [2024-11-12 09:58:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2672 transitions. [2024-11-12 09:58:03,394 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2672 transitions. Word has length 148 [2024-11-12 09:58:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 09:58:03,394 INFO L471 AbstractCegarLoop]: Abstraction has 1942 states and 2672 transitions. [2024-11-12 09:58:03,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 09:58:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2672 transitions. [2024-11-12 09:58:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 09:58:03,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:58:03,399 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 09:58:03,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 09:58:03,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:58:03,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:58:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1736850582, now seen corresponding path program 1 times [2024-11-12 09:58:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:58:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918688620] [2024-11-12 09:58:03,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:58:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:58:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:58:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:58:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:58:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:58:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 09:58:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 09:58:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 09:58:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 09:58:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:58:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 09:58:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 09:58:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 09:58:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-12 09:58:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:58:04,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918688620] [2024-11-12 09:58:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918688620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:58:04,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 09:58:04,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 09:58:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101671783] [2024-11-12 09:58:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:58:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 09:58:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:58:04,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 09:58:04,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 09:58:04,279 INFO L87 Difference]: Start difference. First operand 1942 states and 2672 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 09:58:08,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:12,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:16,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:20,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 09:58:23,051 INFO L93 Difference]: Finished difference Result 4097 states and 5692 transitions. [2024-11-12 09:58:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 09:58:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 148 [2024-11-12 09:58:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 09:58:23,064 INFO L225 Difference]: With dead ends: 4097 [2024-11-12 09:58:23,065 INFO L226 Difference]: Without dead ends: 2186 [2024-11-12 09:58:23,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-12 09:58:23,073 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 488 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 207 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-12 09:58:23,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1199 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1330 Invalid, 4 Unknown, 0 Unchecked, 18.2s Time] [2024-11-12 09:58:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-12 09:58:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1934. [2024-11-12 09:58:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1599 states have (on average 1.368980612883052) internal successors, (2189), 1603 states have internal predecessors, (2189), 218 states have call successors, (218), 105 states have call predecessors, (218), 116 states have return successors, (245), 225 states have call predecessors, (245), 217 states have call successors, (245) [2024-11-12 09:58:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2652 transitions. [2024-11-12 09:58:23,159 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2652 transitions. Word has length 148 [2024-11-12 09:58:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 09:58:23,160 INFO L471 AbstractCegarLoop]: Abstraction has 1934 states and 2652 transitions. [2024-11-12 09:58:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 09:58:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2652 transitions. [2024-11-12 09:58:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-12 09:58:23,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:58:23,165 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-11-12 09:58:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 09:58:23,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:58:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:58:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 884913125, now seen corresponding path program 1 times [2024-11-12 09:58:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:58:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20772603] [2024-11-12 09:58:23,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:58:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:58:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:58:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:58:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:58:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:58:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 09:58:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 09:58:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 09:58:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 09:58:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:58:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 09:58:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:58:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 09:58:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 09:58:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-12 09:58:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:58:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20772603] [2024-11-12 09:58:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20772603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:58:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 09:58:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 09:58:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43041120] [2024-11-12 09:58:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:58:24,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 09:58:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:58:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 09:58:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-12 09:58:24,211 INFO L87 Difference]: Start difference. First operand 1934 states and 2652 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 09:58:28,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:32,249 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-11-12 09:58:36,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:40,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 09:58:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 09:58:43,006 INFO L93 Difference]: Finished difference Result 4129 states and 5720 transitions. [2024-11-12 09:58:43,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 09:58:43,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 155 [2024-11-12 09:58:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 09:58:43,018 INFO L225 Difference]: With dead ends: 4129 [2024-11-12 09:58:43,018 INFO L226 Difference]: Without dead ends: 2226 [2024-11-12 09:58:43,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2024-11-12 09:58:43,025 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 568 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 242 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-11-12 09:58:43,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1674 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2317 Invalid, 4 Unknown, 0 Unchecked, 18.3s Time] [2024-11-12 09:58:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2024-11-12 09:58:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1958. [2024-11-12 09:58:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1619 states have (on average 1.359481161210624) internal successors, (2201), 1619 states have internal predecessors, (2201), 218 states have call successors, (218), 105 states have call predecessors, (218), 120 states have return successors, (249), 233 states have call predecessors, (249), 217 states have call successors, (249) [2024-11-12 09:58:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2668 transitions. [2024-11-12 09:58:43,122 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2668 transitions. Word has length 155 [2024-11-12 09:58:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 09:58:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2668 transitions. [2024-11-12 09:58:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 09:58:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2668 transitions. [2024-11-12 09:58:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 09:58:43,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 09:58:43,128 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 09:58:43,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 09:58:43,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 09:58:43,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 09:58:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1702670698, now seen corresponding path program 1 times [2024-11-12 09:58:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 09:58:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679131742] [2024-11-12 09:58:43,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 09:58:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 09:58:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 09:58:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 09:58:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 09:58:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 09:58:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 09:58:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 09:58:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 09:58:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 09:58:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:58:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 09:58:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 09:58:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 09:58:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 09:58:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 09:58:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-12 09:58:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 09:58:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-12 09:58:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 09:58:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679131742] [2024-11-12 09:58:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679131742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 09:58:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 09:58:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 09:58:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451815635] [2024-11-12 09:58:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 09:58:43,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 09:58:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 09:58:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 09:58:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 09:58:43,959 INFO L87 Difference]: Start difference. First operand 1958 states and 2668 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 8 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)