./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.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 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 13:41:18,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 13:41:18,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 13:41:18,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 13:41:18,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 13:41:18,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 13:41:18,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 13:41:18,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 13:41:18,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 13:41:18,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 13:41:18,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 13:41:18,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 13:41:18,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 13:41:18,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 13:41:18,580 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 13:41:18,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 13:41:18,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 13:41:18,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 13:41:18,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 13:41:18,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 13:41:18,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 13:41:18,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 13:41:18,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 13:41:18,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 13:41:18,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 13:41:18,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 13:41:18,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 13:41:18,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 13:41:18,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 13:41:18,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:41:18,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 13:41:18,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 13:41:18,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 13:41:18,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 13:41:18,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 13:41:18,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 13:41:18,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 13:41:18,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 13:41:18,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 13:41:18,593 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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2024-10-24 13:41:18,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 13:41:18,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 13:41:18,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 13:41:18,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 13:41:18,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 13:41:18,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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--cx82310_eth.ko-entry_point.cil.out.i [2024-10-24 13:41:20,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 13:41:20,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 13:41:20,871 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--cx82310_eth.ko-entry_point.cil.out.i [2024-10-24 13:41:20,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69545fd63/5e86fb6d0687495cab8be9c66b5eb393/FLAGdb04f687a [2024-10-24 13:41:21,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69545fd63/5e86fb6d0687495cab8be9c66b5eb393 [2024-10-24 13:41:21,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 13:41:21,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 13:41:21,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 13:41:21,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 13:41:21,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 13:41:21,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:41:21" (1/1) ... [2024-10-24 13:41:21,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f80ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:21, skipping insertion in model container [2024-10-24 13:41:21,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:41:21" (1/1) ... [2024-10-24 13:41:21,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 13:41:21,796 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2024-10-24 13:41:22,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:41:22,169 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 13:41:22,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2024-10-24 13:41:22,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:41:22,441 INFO L204 MainTranslator]: Completed translation [2024-10-24 13:41:22,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22 WrapperNode [2024-10-24 13:41:22,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 13:41:22,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 13:41:22,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 13:41:22,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 13:41:22,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,562 INFO L138 Inliner]: procedures = 102, calls = 322, calls flagged for inlining = 36, calls inlined = 33, statements flattened = 1053 [2024-10-24 13:41:22,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 13:41:22,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 13:41:22,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 13:41:22,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 13:41:22,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,685 INFO L175 MemorySlicer]: Split 165 memory accesses to 10 slices as follows [79, 2, 17, 42, 2, 3, 2, 3, 14, 1]. 48 percent of accesses are in the largest equivalence class. The 63 initializations are split as follows [2, 2, 17, 42, 0, 0, 0, 0, 0, 0]. The 38 writes are split as follows [19, 0, 0, 0, 1, 1, 0, 2, 14, 1]. [2024-10-24 13:41:22,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 13:41:22,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 13:41:22,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 13:41:22,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 13:41:22,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (1/1) ... [2024-10-24 13:41:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:41:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:41:22,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 13:41:22,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 13:41:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-24 13:41:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-24 13:41:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-24 13:41:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-24 13:41:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-24 13:41:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-24 13:41:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-24 13:41:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-24 13:41:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-24 13:41:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-24 13:41:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-24 13:41:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2024-10-24 13:41:22,989 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2024-10-24 13:41:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 13:41:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 13:41:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 13:41:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 13:41:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 13:41:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 13:41:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 13:41:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 13:41:22,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 13:41:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 13:41:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 13:41:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 13:41:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2024-10-24 13:41:22,998 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2024-10-24 13:41:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2024-10-24 13:41:22,998 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2024-10-24 13:41:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-24 13:41:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-24 13:41:22,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-24 13:41:22,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-24 13:41:22,999 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-24 13:41:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-24 13:41:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 13:41:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2024-10-24 13:41:23,000 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2024-10-24 13:41:23,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2024-10-24 13:41:23,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2024-10-24 13:41:23,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2024-10-24 13:41:23,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2024-10-24 13:41:23,001 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 13:41:23,001 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 13:41:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 13:41:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 13:41:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-24 13:41:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-24 13:41:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2024-10-24 13:41:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-10-24 13:41:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-10-24 13:41:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 13:41:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 13:41:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-10-24 13:41:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2024-10-24 13:41:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 13:41:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 13:41:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 13:41:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 13:41:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 13:41:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 13:41:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 13:41:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 13:41:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 13:41:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2024-10-24 13:41:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-24 13:41:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-24 13:41:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-24 13:41:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-24 13:41:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2024-10-24 13:41:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2024-10-24 13:41:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 13:41:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 13:41:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 13:41:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 13:41:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 13:41:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-24 13:41:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-24 13:41:23,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-24 13:41:23,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 13:41:23,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 13:41:23,414 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 13:41:23,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 13:41:23,461 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 13:41:25,309 INFO L? ?]: Removed 592 outVars from TransFormulas that were not future-live. [2024-10-24 13:41:25,313 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 13:41:25,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 13:41:25,539 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 13:41:25,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:41:25 BoogieIcfgContainer [2024-10-24 13:41:25,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 13:41:25,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 13:41:25,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 13:41:25,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 13:41:25,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:41:21" (1/3) ... [2024-10-24 13:41:25,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f472516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:41:25, skipping insertion in model container [2024-10-24 13:41:25,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:41:22" (2/3) ... [2024-10-24 13:41:25,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f472516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:41:25, skipping insertion in model container [2024-10-24 13:41:25,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:41:25" (3/3) ... [2024-10-24 13:41:25,550 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2024-10-24 13:41:25,568 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 13:41:25,569 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 13:41:25,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 13:41:25,668 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;@2a54813b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 13:41:25,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 13:41:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 205 states have (on average 1.473170731707317) internal successors, (302), 211 states have internal predecessors, (302), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 13:41:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 13:41:25,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:25,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:41:25,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:25,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1114389031, now seen corresponding path program 1 times [2024-10-24 13:41:25,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:25,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942726460] [2024-10-24 13:41:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:41:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:41:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:26,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942726460] [2024-10-24 13:41:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942726460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:26,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:41:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113973484] [2024-10-24 13:41:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:26,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:41:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:41:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:41:26,520 INFO L87 Difference]: Start difference. First operand has 292 states, 205 states have (on average 1.473170731707317) internal successors, (302), 211 states have internal predecessors, (302), 63 states have call successors, (63), 23 states have call predecessors, (63), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:41:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:30,180 INFO L93 Difference]: Finished difference Result 961 states and 1507 transitions. [2024-10-24 13:41:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 13:41:30,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-24 13:41:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:30,208 INFO L225 Difference]: With dead ends: 961 [2024-10-24 13:41:30,209 INFO L226 Difference]: Without dead ends: 659 [2024-10-24 13:41:30,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-10-24 13:41:30,222 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1364 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:30,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 628 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 13:41:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-24 13:41:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 541. [2024-10-24 13:41:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 390 states have (on average 1.4256410256410257) internal successors, (556), 390 states have internal predecessors, (556), 110 states have call successors, (110), 41 states have call predecessors, (110), 40 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-24 13:41:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 775 transitions. [2024-10-24 13:41:30,351 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 775 transitions. Word has length 27 [2024-10-24 13:41:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:30,352 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 775 transitions. [2024-10-24 13:41:30,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 13:41:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 775 transitions. [2024-10-24 13:41:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 13:41:30,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:30,356 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] [2024-10-24 13:41:30,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 13:41:30,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:30,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1228862157, now seen corresponding path program 1 times [2024-10-24 13:41:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:30,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657446800] [2024-10-24 13:41:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:30,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:30,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:41:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:41:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 13:41:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:30,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657446800] [2024-10-24 13:41:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657446800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 13:41:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170655266] [2024-10-24 13:41:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:30,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 13:41:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 13:41:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 13:41:30,670 INFO L87 Difference]: Start difference. First operand 541 states and 775 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 13:41:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:34,859 INFO L93 Difference]: Finished difference Result 1826 states and 2742 transitions. [2024-10-24 13:41:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 13:41:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-10-24 13:41:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:34,875 INFO L225 Difference]: With dead ends: 1826 [2024-10-24 13:41:34,877 INFO L226 Difference]: Without dead ends: 1296 [2024-10-24 13:41:34,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-24 13:41:34,883 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1339 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:34,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 766 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 13:41:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-10-24 13:41:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1064. [2024-10-24 13:41:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 769 states have (on average 1.422626788036411) internal successors, (1094), 769 states have internal predecessors, (1094), 216 states have call successors, (216), 79 states have call predecessors, (216), 78 states have return successors, (225), 215 states have call predecessors, (225), 215 states have call successors, (225) [2024-10-24 13:41:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1535 transitions. [2024-10-24 13:41:34,994 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1535 transitions. Word has length 36 [2024-10-24 13:41:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:34,995 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1535 transitions. [2024-10-24 13:41:34,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 13:41:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1535 transitions. [2024-10-24 13:41:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 13:41:35,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:35,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:41:35,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 13:41:35,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:35,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash 671338867, now seen corresponding path program 1 times [2024-10-24 13:41:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126840839] [2024-10-24 13:41:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:41:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 13:41:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:41:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 13:41:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 13:41:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126840839] [2024-10-24 13:41:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126840839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 13:41:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965194256] [2024-10-24 13:41:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:35,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 13:41:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 13:41:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:41:35,347 INFO L87 Difference]: Start difference. First operand 1064 states and 1535 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 13:41:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:38,544 INFO L93 Difference]: Finished difference Result 2594 states and 3856 transitions. [2024-10-24 13:41:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 13:41:38,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-10-24 13:41:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:38,558 INFO L225 Difference]: With dead ends: 2594 [2024-10-24 13:41:38,559 INFO L226 Difference]: Without dead ends: 1543 [2024-10-24 13:41:38,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-10-24 13:41:38,564 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 804 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:38,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 601 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 13:41:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-10-24 13:41:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1336. [2024-10-24 13:41:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1000 states have (on average 1.448) internal successors, (1448), 1004 states have internal predecessors, (1448), 235 states have call successors, (235), 89 states have call predecessors, (235), 100 states have return successors, (282), 242 states have call predecessors, (282), 234 states have call successors, (282) [2024-10-24 13:41:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1965 transitions. [2024-10-24 13:41:38,695 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1965 transitions. Word has length 73 [2024-10-24 13:41:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:38,696 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1965 transitions. [2024-10-24 13:41:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 13:41:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1965 transitions. [2024-10-24 13:41:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 13:41:38,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:38,701 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-10-24 13:41:38,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 13:41:38,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:38,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash 185437355, now seen corresponding path program 1 times [2024-10-24 13:41:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:38,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831329085] [2024-10-24 13:41:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:41:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:41:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:41:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 13:41:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 13:41:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:41:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:39,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:41:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 13:41:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831329085] [2024-10-24 13:41:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831329085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 13:41:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411725759] [2024-10-24 13:41:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:39,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 13:41:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:39,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 13:41:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:41:39,071 INFO L87 Difference]: Start difference. First operand 1336 states and 1965 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 13:41:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:44,501 INFO L93 Difference]: Finished difference Result 3778 states and 5646 transitions. [2024-10-24 13:41:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 13:41:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-10-24 13:41:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:44,519 INFO L225 Difference]: With dead ends: 3778 [2024-10-24 13:41:44,520 INFO L226 Difference]: Without dead ends: 2465 [2024-10-24 13:41:44,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-24 13:41:44,528 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1115 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:44,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1055 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-24 13:41:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-24 13:41:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2074. [2024-10-24 13:41:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1558 states have (on average 1.4351732991014121) internal successors, (2236), 1566 states have internal predecessors, (2236), 343 states have call successors, (343), 149 states have call predecessors, (343), 172 states have return successors, (425), 358 states have call predecessors, (425), 342 states have call successors, (425) [2024-10-24 13:41:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3004 transitions. [2024-10-24 13:41:44,671 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3004 transitions. Word has length 97 [2024-10-24 13:41:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:44,673 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3004 transitions. [2024-10-24 13:41:44,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 13:41:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3004 transitions. [2024-10-24 13:41:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 13:41:44,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:44,677 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-10-24 13:41:44,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 13:41:44,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:44,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2026029503, now seen corresponding path program 1 times [2024-10-24 13:41:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456210920] [2024-10-24 13:41:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:41:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:41:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:41:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 13:41:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 13:41:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 13:41:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:41:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-24 13:41:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456210920] [2024-10-24 13:41:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456210920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:45,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 13:41:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683750183] [2024-10-24 13:41:45,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 13:41:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 13:41:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 13:41:45,566 INFO L87 Difference]: Start difference. First operand 2074 states and 3004 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 13:41:49,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:41:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:41:54,067 INFO L93 Difference]: Finished difference Result 4511 states and 6685 transitions. [2024-10-24 13:41:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 13:41:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-10-24 13:41:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:41:54,085 INFO L225 Difference]: With dead ends: 4511 [2024-10-24 13:41:54,086 INFO L226 Difference]: Without dead ends: 2460 [2024-10-24 13:41:54,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2024-10-24 13:41:54,097 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 668 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-24 13:41:54,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1512 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-24 13:41:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2024-10-24 13:41:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2154. [2024-10-24 13:41:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1622 states have (on average 1.4254007398273736) internal successors, (2312), 1634 states have internal predecessors, (2312), 343 states have call successors, (343), 149 states have call predecessors, (343), 188 states have return successors, (450), 370 states have call predecessors, (450), 342 states have call successors, (450) [2024-10-24 13:41:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3105 transitions. [2024-10-24 13:41:54,307 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3105 transitions. Word has length 97 [2024-10-24 13:41:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:41:54,307 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 3105 transitions. [2024-10-24 13:41:54,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 13:41:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3105 transitions. [2024-10-24 13:41:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 13:41:54,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:41:54,311 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2024-10-24 13:41:54,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 13:41:54,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:41:54,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:41:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1315635199, now seen corresponding path program 1 times [2024-10-24 13:41:54,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:41:54,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012727279] [2024-10-24 13:41:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:41:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:41:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:41:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:41:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:41:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:41:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 13:41:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 13:41:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 13:41:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:41:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:41:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:41:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:41:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-24 13:41:55,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:41:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012727279] [2024-10-24 13:41:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012727279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:41:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:41:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 13:41:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296530337] [2024-10-24 13:41:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:41:55,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 13:41:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:41:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 13:41:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 13:41:55,115 INFO L87 Difference]: Start difference. First operand 2154 states and 3105 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 13:42:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:42:02,150 INFO L93 Difference]: Finished difference Result 4599 states and 6774 transitions. [2024-10-24 13:42:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 13:42:02,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-24 13:42:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:42:02,168 INFO L225 Difference]: With dead ends: 4599 [2024-10-24 13:42:02,168 INFO L226 Difference]: Without dead ends: 2468 [2024-10-24 13:42:02,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-10-24 13:42:02,180 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 762 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-24 13:42:02,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1415 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-24 13:42:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2024-10-24 13:42:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2114. [2024-10-24 13:42:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1586 states have (on average 1.4224464060529634) internal successors, (2256), 1598 states have internal predecessors, (2256), 343 states have call successors, (343), 149 states have call predecessors, (343), 184 states have return successors, (442), 366 states have call predecessors, (442), 342 states have call successors, (442) [2024-10-24 13:42:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3041 transitions. [2024-10-24 13:42:02,381 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3041 transitions. Word has length 103 [2024-10-24 13:42:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:42:02,382 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 3041 transitions. [2024-10-24 13:42:02,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 13:42:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3041 transitions. [2024-10-24 13:42:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 13:42:02,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:42:02,386 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:42:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 13:42:02,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:42:02,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:42:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1036710570, now seen corresponding path program 1 times [2024-10-24 13:42:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:42:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717165980] [2024-10-24 13:42:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:42:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:42:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:42:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:42:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 13:42:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 13:42:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 13:42:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:02,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 13:42:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-24 13:42:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:42:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717165980] [2024-10-24 13:42:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717165980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:42:03,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:42:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 13:42:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167704511] [2024-10-24 13:42:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:42:03,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 13:42:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:42:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 13:42:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 13:42:03,142 INFO L87 Difference]: Start difference. First operand 2114 states and 3041 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 13:42:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:42:08,584 INFO L93 Difference]: Finished difference Result 4827 states and 7242 transitions. [2024-10-24 13:42:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 13:42:08,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-24 13:42:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:42:08,604 INFO L225 Difference]: With dead ends: 4827 [2024-10-24 13:42:08,605 INFO L226 Difference]: Without dead ends: 2736 [2024-10-24 13:42:08,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-24 13:42:08,616 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 673 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:42:08,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 985 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-24 13:42:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2024-10-24 13:42:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2182. [2024-10-24 13:42:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 1610 states have (on average 1.4062111801242236) internal successors, (2264), 1618 states have internal predecessors, (2264), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-24 13:42:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3157 transitions. [2024-10-24 13:42:08,813 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3157 transitions. Word has length 103 [2024-10-24 13:42:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:42:08,815 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 3157 transitions. [2024-10-24 13:42:08,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 13:42:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3157 transitions. [2024-10-24 13:42:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 13:42:08,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:42:08,819 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2024-10-24 13:42:08,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 13:42:08,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:42:08,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:42:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1993471852, now seen corresponding path program 1 times [2024-10-24 13:42:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:42:08,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901526167] [2024-10-24 13:42:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:42:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:42:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 13:42:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:42:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 13:42:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 13:42:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 13:42:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-24 13:42:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:42:09,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901526167] [2024-10-24 13:42:09,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901526167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:42:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:42:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 13:42:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500065251] [2024-10-24 13:42:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:42:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 13:42:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:42:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 13:42:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:42:09,418 INFO L87 Difference]: Start difference. First operand 2182 states and 3157 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 13:42:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:42:13,344 INFO L93 Difference]: Finished difference Result 4901 states and 7281 transitions. [2024-10-24 13:42:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 13:42:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-10-24 13:42:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:42:13,363 INFO L225 Difference]: With dead ends: 4901 [2024-10-24 13:42:13,363 INFO L226 Difference]: Without dead ends: 2735 [2024-10-24 13:42:13,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-24 13:42:13,372 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 667 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 13:42:13,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 850 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 13:42:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-24 13:42:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2183. [2024-10-24 13:42:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1611 states have (on average 1.4059590316573556) internal successors, (2265), 1619 states have internal predecessors, (2265), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-24 13:42:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3158 transitions. [2024-10-24 13:42:13,598 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3158 transitions. Word has length 109 [2024-10-24 13:42:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:42:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3158 transitions. [2024-10-24 13:42:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 8 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 13:42:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3158 transitions. [2024-10-24 13:42:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 13:42:13,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:42:13,605 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2024-10-24 13:42:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 13:42:13,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:42:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:42:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -237629149, now seen corresponding path program 1 times [2024-10-24 13:42:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:42:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510417301] [2024-10-24 13:42:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:42:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:42:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 13:42:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 13:42:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 13:42:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 13:42:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 13:42:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:42:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-24 13:42:14,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:42:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510417301] [2024-10-24 13:42:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510417301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:42:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914864718] [2024-10-24 13:42:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:14,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:42:14,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:42:14,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 13:42:14,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 13:42:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:14,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 13:42:14,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:42:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-24 13:42:14,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 13:42:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-24 13:42:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914864718] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 13:42:15,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 13:42:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 6] total 16 [2024-10-24 13:42:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075118776] [2024-10-24 13:42:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:42:15,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:42:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:42:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:42:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-24 13:42:15,058 INFO L87 Difference]: Start difference. First operand 2183 states and 3158 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 13:42:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:42:16,132 INFO L93 Difference]: Finished difference Result 4345 states and 6293 transitions. [2024-10-24 13:42:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:42:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-10-24 13:42:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:42:16,152 INFO L225 Difference]: With dead ends: 4345 [2024-10-24 13:42:16,153 INFO L226 Difference]: Without dead ends: 2184 [2024-10-24 13:42:16,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-24 13:42:16,162 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 13:42:16,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 735 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 13:42:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-10-24 13:42:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2024-10-24 13:42:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1612 states have (on average 1.4057071960297767) internal successors, (2266), 1620 states have internal predecessors, (2266), 391 states have call successors, (391), 149 states have call predecessors, (391), 180 states have return successors, (502), 414 states have call predecessors, (502), 390 states have call successors, (502) [2024-10-24 13:42:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3159 transitions. [2024-10-24 13:42:16,390 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3159 transitions. Word has length 110 [2024-10-24 13:42:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:42:16,390 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3159 transitions. [2024-10-24 13:42:16,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 13:42:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3159 transitions. [2024-10-24 13:42:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 13:42:16,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:42:16,395 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 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] [2024-10-24 13:42:16,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 13:42:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:42:16,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:42:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:42:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1840050702, now seen corresponding path program 1 times [2024-10-24 13:42:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:42:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145492088] [2024-10-24 13:42:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:42:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:42:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 13:42:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 13:42:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 13:42:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 13:42:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:42:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 13:42:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-24 13:42:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:42:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145492088] [2024-10-24 13:42:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145492088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:42:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979478418] [2024-10-24 13:42:17,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:17,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:42:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:42:17,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 13:42:17,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 13:42:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:17,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-24 13:42:17,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:42:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 13:42:18,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 13:42:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979478418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:42:18,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 13:42:18,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-10-24 13:42:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585064195] [2024-10-24 13:42:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:42:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 13:42:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:42:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 13:42:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-24 13:42:18,133 INFO L87 Difference]: Start difference. First operand 2184 states and 3159 transitions. Second operand has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 13:42:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:42:23,929 INFO L93 Difference]: Finished difference Result 4665 states and 6824 transitions. [2024-10-24 13:42:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 13:42:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-10-24 13:42:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:42:23,946 INFO L225 Difference]: With dead ends: 4665 [2024-10-24 13:42:23,947 INFO L226 Difference]: Without dead ends: 2506 [2024-10-24 13:42:23,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-24 13:42:23,955 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 35 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5420 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-24 13:42:23,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5420 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-24 13:42:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2024-10-24 13:42:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2228. [2024-10-24 13:42:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1644 states have (on average 1.397810218978102) internal successors, (2298), 1648 states have internal predecessors, (2298), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 430 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-24 13:42:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3219 transitions. [2024-10-24 13:42:24,161 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3219 transitions. Word has length 111 [2024-10-24 13:42:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:42:24,161 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3219 transitions. [2024-10-24 13:42:24,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 13:42:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3219 transitions. [2024-10-24 13:42:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 13:42:24,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:42:24,206 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:42:24,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 13:42:24,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 13:42:24,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:42:24,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:42:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1500877451, now seen corresponding path program 1 times [2024-10-24 13:42:24,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:42:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7630045] [2024-10-24 13:42:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:42:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:42:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 13:42:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 13:42:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 13:42:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 13:42:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:42:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 13:42:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 13:42:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:42:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-24 13:42:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:42:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7630045] [2024-10-24 13:42:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7630045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:42:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:42:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 13:42:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29951656] [2024-10-24 13:42:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:42:24,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 13:42:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:42:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 13:42:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 13:42:24,792 INFO L87 Difference]: Start difference. First operand 2228 states and 3219 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 13:42:26,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:42:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:42:29,208 INFO L93 Difference]: Finished difference Result 5001 states and 7458 transitions. [2024-10-24 13:42:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 13:42:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-10-24 13:42:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:42:29,225 INFO L225 Difference]: With dead ends: 5001 [2024-10-24 13:42:29,226 INFO L226 Difference]: Without dead ends: 2798 [2024-10-24 13:42:29,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-24 13:42:29,234 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 664 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 13:42:29,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 718 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 13:42:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-24 13:42:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2240. [2024-10-24 13:42:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 1656 states have (on average 1.394927536231884) internal successors, (2310), 1660 states have internal predecessors, (2310), 395 states have call successors, (395), 149 states have call predecessors, (395), 188 states have return successors, (526), 430 states have call predecessors, (526), 394 states have call successors, (526) [2024-10-24 13:42:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3231 transitions. [2024-10-24 13:42:29,456 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3231 transitions. Word has length 129 [2024-10-24 13:42:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:42:29,457 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3231 transitions. [2024-10-24 13:42:29,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 8 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 13:42:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3231 transitions. [2024-10-24 13:42:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 13:42:29,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:42:29,463 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:42:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 13:42:29,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:42:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:42:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1944778125, now seen corresponding path program 1 times [2024-10-24 13:42:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:42:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412863573] [2024-10-24 13:42:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:42:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:42:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 13:42:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 13:42:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 13:42:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 13:42:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:42:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 13:42:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 13:42:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:42:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:42:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:42:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:42:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-24 13:42:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:42:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412863573] [2024-10-24 13:42:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412863573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:42:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267186287] [2024-10-24 13:42:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:42:30,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:42:30,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:42:30,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 13:42:30,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 13:42:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:42:30,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-24 13:42:30,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:42:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-24 13:42:31,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 13:42:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267186287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:42:31,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 13:42:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2024-10-24 13:42:31,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129073745] [2024-10-24 13:42:31,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:42:31,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 13:42:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:42:31,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 13:42:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2024-10-24 13:42:31,035 INFO L87 Difference]: Start difference. First operand 2240 states and 3231 transitions. Second operand has 15 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15)