./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 04:18:35,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:18:35,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 04:18:35,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:18:35,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:18:35,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:18:35,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:18:35,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:18:35,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 04:18:35,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 04:18:35,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:18:35,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:18:35,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:18:35,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:18:35,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 04:18:35,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:18:35,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:18:35,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:18:35,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:18:35,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:18:35,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:18:35,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:18:35,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:18:35,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:18:35,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:18:35,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:18:35,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:18:35,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:18:35,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:18:35,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:18:35,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:18:35,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:18:35,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:18:35,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 04:18:35,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:18:35,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:18:35,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 04:18:35,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 04:18:35,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:18:35,385 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-09 04:18:35,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:18:35,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:18:35,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:18:35,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:18:35,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:18:35,610 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-09 04:18:37,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:18:37,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:18:37,404 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-09 04:18:37,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb70c01/f1ab65e90f9f49728752640f9486c76f/FLAG86d4ba034 [2024-11-09 04:18:37,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceb70c01/f1ab65e90f9f49728752640f9486c76f [2024-11-09 04:18:37,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:18:37,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:18:37,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:18:37,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:18:37,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:18:37,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:18:37" (1/1) ... [2024-11-09 04:18:37,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b1b0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:37, skipping insertion in model container [2024-11-09 04:18:37,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:18:37" (1/1) ... [2024-11-09 04:18:37,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:18:38,100 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-09 04:18:38,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:18:38,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:18:38,360 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-09 04:18:38,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:18:38,514 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:18:38,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38 WrapperNode [2024-11-09 04:18:38,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:18:38,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:18:38,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:18:38,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:18:38,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,606 INFO L138 Inliner]: procedures = 101, calls = 399, calls flagged for inlining = 41, calls inlined = 38, statements flattened = 1059 [2024-11-09 04:18:38,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:18:38,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:18:38,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:18:38,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:18:38,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,740 INFO L175 MemorySlicer]: Split 259 memory accesses to 11 slices as follows [2, 2, 3, 21, 21, 7, 19, 90, 44, 17, 33]. 35 percent of accesses are in the largest equivalence class. The 78 initializations are split as follows [2, 0, 0, 0, 21, 7, 0, 0, 0, 15, 33]. The 113 writes are split as follows [0, 1, 1, 18, 0, 0, 19, 29, 44, 1, 0]. [2024-11-09 04:18:38,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:18:38,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:18:38,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:18:38,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:18:38,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (1/1) ... [2024-11-09 04:18:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 04:18:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:18:38,848 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-09 04:18:38,850 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-09 04:18:38,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-09 04:18:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-09 04:18:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-11-09 04:18:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-09 04:18:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-09 04:18:38,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 04:18:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 04:18:38,901 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2024-11-09 04:18:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2024-11-09 04:18:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-11-09 04:18:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-11-09 04:18:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 04:18:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 04:18:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2024-11-09 04:18:38,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2024-11-09 04:18:38,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 04:18:38,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-09 04:18:38,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2024-11-09 04:18:38,904 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-09 04:18:38,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-11-09 04:18:38,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-11-09 04:18:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-11-09 04:18:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-11-09 04:18:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-11-09 04:18:38,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2024-11-09 04:18:38,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 04:18:38,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 04:18:38,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 04:18:38,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2024-11-09 04:18:38,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 04:18:38,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_netdev_dbg [2024-11-09 04:18:38,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_netdev_dbg [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 04:18:38,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 04:18:38,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 04:18:38,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_tx_fixup [2024-11-09 04:18:38,910 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_tx_fixup [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure genelink_rx_fixup [2024-11-09 04:18:38,910 INFO L138 BoogieDeclarations]: Found implementation of procedure genelink_rx_fixup [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 04:18:38,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-09 04:18:38,911 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2024-11-09 04:18:38,912 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 04:18:38,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-09 04:18:38,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-09 04:18:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-11-09 04:18:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-11-09 04:18:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-11-09 04:18:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-11-09 04:18:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-09 04:18:38,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-09 04:18:38,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:18:38,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:18:39,237 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:18:39,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:18:39,257 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-09 04:18:44,080 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-11-09 04:18:44,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:18:44,098 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:18:44,098 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 04:18:44,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:18:44 BoogieIcfgContainer [2024-11-09 04:18:44,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:18:44,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:18:44,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:18:44,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:18:44,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:18:37" (1/3) ... [2024-11-09 04:18:44,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0f7094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:18:44, skipping insertion in model container [2024-11-09 04:18:44,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:18:38" (2/3) ... [2024-11-09 04:18:44,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0f7094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:18:44, skipping insertion in model container [2024-11-09 04:18:44,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:18:44" (3/3) ... [2024-11-09 04:18:44,105 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-09 04:18:44,118 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:18:44,118 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:18:44,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:18:44,170 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;@517f7978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:18:44,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:18:44,174 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-09 04:18:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 04:18:44,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:18:44,183 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:18:44,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:18:44,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:18:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash 648276889, now seen corresponding path program 1 times [2024-11-09 04:18:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:18:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398179877] [2024-11-09 04:18:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:18:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:18:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:18:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:18:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:18:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:18:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:45,041 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-09 04:18:45,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:18:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398179877] [2024-11-09 04:18:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398179877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:18:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:18:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:18:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603677689] [2024-11-09 04:18:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:18:45,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:18:45,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:18:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:18:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:18:45,066 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-09 04:18:49,090 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-09 04:18:53,099 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-09 04:18:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:18:54,871 INFO L93 Difference]: Finished difference Result 796 states and 1160 transitions. [2024-11-09 04:18:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:18:54,874 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-09 04:18:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:18:54,889 INFO L225 Difference]: With dead ends: 796 [2024-11-09 04:18:54,889 INFO L226 Difference]: Without dead ends: 525 [2024-11-09 04:18:54,897 INFO L431 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-09 04:18:54,899 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1059 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 363 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:18:54,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 687 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 619 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-09 04:18:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-09 04:18:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 457. [2024-11-09 04:18:55,017 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-09 04:18:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 625 transitions. [2024-11-09 04:18:55,021 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 625 transitions. Word has length 42 [2024-11-09 04:18:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:18:55,022 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 625 transitions. [2024-11-09 04:18:55,022 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-09 04:18:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 625 transitions. [2024-11-09 04:18:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 04:18:55,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:18:55,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:18:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:18:55,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:18:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:18:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -801950197, now seen corresponding path program 1 times [2024-11-09 04:18:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:18:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570334507] [2024-11-09 04:18:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:18:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:18:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:18:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:18:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:18:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:18:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:18:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:18:55,650 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-09 04:18:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:18:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570334507] [2024-11-09 04:18:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570334507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:18:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:18:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:18:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862206698] [2024-11-09 04:18:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:18:55,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:18:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:18:55,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:18:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:18:55,654 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-09 04:18:59,665 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-09 04:19:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:19:01,682 INFO L93 Difference]: Finished difference Result 1458 states and 2039 transitions. [2024-11-09 04:19:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:19:01,682 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-09 04:19:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:19:01,690 INFO L225 Difference]: With dead ends: 1458 [2024-11-09 04:19:01,691 INFO L226 Difference]: Without dead ends: 1015 [2024-11-09 04:19:01,693 INFO L431 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-09 04:19:01,694 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1076 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 355 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:19:01,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 928 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 1049 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-09 04:19:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-09 04:19:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 885. [2024-11-09 04:19:01,745 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-09 04:19:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1219 transitions. [2024-11-09 04:19:01,752 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1219 transitions. Word has length 52 [2024-11-09 04:19:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:19:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1219 transitions. [2024-11-09 04:19:01,754 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-09 04:19:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1219 transitions. [2024-11-09 04:19:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 04:19:01,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:19:01,766 INFO L215 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-09 04:19:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:19:01,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:19:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:19:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1078821662, now seen corresponding path program 1 times [2024-11-09 04:19:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:19:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842850001] [2024-11-09 04:19:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:19:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:19:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:19:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:19:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:19:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:19:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:19:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:19:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:19:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 04:19:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 04:19:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 04:19:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:02,783 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-09 04:19:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:19:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842850001] [2024-11-09 04:19:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842850001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:19:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384530988] [2024-11-09 04:19:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:19:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:19:02,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 04:19:02,785 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-09 04:19:02,787 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-09 04:19:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:03,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:19:03,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:19:03,420 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-09 04:19:03,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:19:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384530988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:19:03,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:19:03,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-11-09 04:19:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037480872] [2024-11-09 04:19:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:19:03,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:19:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:19:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:19:03,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:19:03,422 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-09 04:19:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:19:03,504 INFO L93 Difference]: Finished difference Result 2028 states and 2833 transitions. [2024-11-09 04:19:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:19:03,505 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-09 04:19:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:19:03,509 INFO L225 Difference]: With dead ends: 2028 [2024-11-09 04:19:03,509 INFO L226 Difference]: Without dead ends: 1163 [2024-11-09 04:19:03,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:19:03,512 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 129 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:19:03,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 635 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:19:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-09 04:19:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1154. [2024-11-09 04:19:03,594 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-09 04:19:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1606 transitions. [2024-11-09 04:19:03,599 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1606 transitions. Word has length 126 [2024-11-09 04:19:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:19:03,599 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1606 transitions. [2024-11-09 04:19:03,599 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-09 04:19:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1606 transitions. [2024-11-09 04:19:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 04:19:03,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:19:03,602 INFO L215 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-09 04:19:03,619 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-09 04:19:03,810 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-09 04:19:03,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:19:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:19:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1882104542, now seen corresponding path program 1 times [2024-11-09 04:19:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:19:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589738729] [2024-11-09 04:19:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:19:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:19:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:19:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:19:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:19:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:19:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:19:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:19:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 04:19:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 04:19:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:19:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:19:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 04:19:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 04:19:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:04,439 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-09 04:19:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:19:04,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589738729] [2024-11-09 04:19:04,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589738729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:19:04,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:19:04,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:19:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343991738] [2024-11-09 04:19:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:19:04,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:19:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:19:04,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:19:04,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:19:04,441 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-09 04:19:08,455 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-09 04:19:12,467 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-09 04:19:16,480 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-09 04:19:20,496 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-09 04:19:24,502 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-09 04:19:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:19:27,013 INFO L93 Difference]: Finished difference Result 3378 states and 4718 transitions. [2024-11-09 04:19:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:19:27,013 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-09 04:19:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:19:27,023 INFO L225 Difference]: With dead ends: 3378 [2024-11-09 04:19:27,023 INFO L226 Difference]: Without dead ends: 2255 [2024-11-09 04:19:27,026 INFO L431 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-09 04:19:27,028 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1099 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 365 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:19:27,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1318 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 967 Invalid, 5 Unknown, 0 Unchecked, 22.1s Time] [2024-11-09 04:19:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2024-11-09 04:19:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1942. [2024-11-09 04:19:27,127 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-09 04:19:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2672 transitions. [2024-11-09 04:19:27,135 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2672 transitions. Word has length 148 [2024-11-09 04:19:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:19:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 1942 states and 2672 transitions. [2024-11-09 04:19:27,135 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-09 04:19:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2672 transitions. [2024-11-09 04:19:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 04:19:27,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:19:27,140 INFO L215 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-09 04:19:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:19:27,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:19:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:19:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash 102961978, now seen corresponding path program 1 times [2024-11-09 04:19:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:19:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233029921] [2024-11-09 04:19:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:19:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:19:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:19:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:19:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:19:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:19:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:19:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:19:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 04:19:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 04:19:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:19:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:19:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 04:19:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 04:19:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:28,313 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-09 04:19:28,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:19:28,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233029921] [2024-11-09 04:19:28,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233029921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:19:28,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:19:28,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:19:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451509007] [2024-11-09 04:19:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:19:28,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 04:19:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:19:28,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 04:19:28,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:19:28,317 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-09 04:19:32,329 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-09 04:19:36,343 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-09 04:19:40,348 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-09 04:19:44,362 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-09 04:19:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:19:46,473 INFO L93 Difference]: Finished difference Result 4097 states and 5692 transitions. [2024-11-09 04:19:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:19:46,474 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-09 04:19:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:19:46,487 INFO L225 Difference]: With dead ends: 4097 [2024-11-09 04:19:46,487 INFO L226 Difference]: Without dead ends: 2186 [2024-11-09 04:19:46,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-09 04:19:46,494 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 488 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 207 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s 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, 17.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:19:46,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1199 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1330 Invalid, 4 Unknown, 0 Unchecked, 17.7s Time] [2024-11-09 04:19:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2024-11-09 04:19:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1934. [2024-11-09 04:19:46,655 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-09 04:19:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2652 transitions. [2024-11-09 04:19:46,664 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2652 transitions. Word has length 148 [2024-11-09 04:19:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:19:46,665 INFO L471 AbstractCegarLoop]: Abstraction has 1934 states and 2652 transitions. [2024-11-09 04:19:46,665 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-09 04:19:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2652 transitions. [2024-11-09 04:19:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 04:19:46,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:19:46,669 INFO L215 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-09 04:19:46,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:19:46,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:19:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:19:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash -161096511, now seen corresponding path program 1 times [2024-11-09 04:19:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:19:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099611573] [2024-11-09 04:19:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:19:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:19:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:19:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:19:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:19:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:19:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:19:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:19:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 04:19:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 04:19:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:19:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:19:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:19:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 04:19:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 04:19:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:19:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:19:47,849 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-09 04:19:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:19:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099611573] [2024-11-09 04:19:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099611573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:19:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:19:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 04:19:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646679177] [2024-11-09 04:19:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:19:47,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:19:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:19:47,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:19:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:19:47,852 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-09 04:19:51,865 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-09 04:19:55,881 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-09 04:19:59,891 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-09 04:20:03,899 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-09 04:20:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:20:06,443 INFO L93 Difference]: Finished difference Result 4129 states and 5720 transitions. [2024-11-09 04:20:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:20:06,443 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-09 04:20:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:20:06,453 INFO L225 Difference]: With dead ends: 4129 [2024-11-09 04:20:06,453 INFO L226 Difference]: Without dead ends: 2226 [2024-11-09 04:20:06,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2024-11-09 04:20:06,459 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 568 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 244 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:20:06,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1674 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2307 Invalid, 4 Unknown, 0 Unchecked, 18.1s Time] [2024-11-09 04:20:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2024-11-09 04:20:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1958. [2024-11-09 04:20:06,529 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-09 04:20:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2668 transitions. [2024-11-09 04:20:06,538 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2668 transitions. Word has length 155 [2024-11-09 04:20:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:20:06,538 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2668 transitions. [2024-11-09 04:20:06,538 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-09 04:20:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2668 transitions. [2024-11-09 04:20:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 04:20:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:20:06,544 INFO L215 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-09 04:20:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:20:06,545 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:20:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:20:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1308138894, now seen corresponding path program 1 times [2024-11-09 04:20:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 04:20:06,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677323284] [2024-11-09 04:20:06,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:20:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:20:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 04:20:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 04:20:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 04:20:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 04:20:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 04:20:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 04:20:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 04:20:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 04:20:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:20:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:20:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 04:20:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:20:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 04:20:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 04:20:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 04:20:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:20:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 04:20:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 04:20:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:20:07,396 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-09 04:20:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 04:20:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677323284] [2024-11-09 04:20:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677323284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:20:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:20:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:20:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347607042] [2024-11-09 04:20:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:20:07,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:20:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 04:20:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:20:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:20:07,399 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) [2024-11-09 04:20:11,411 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 []