./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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.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 f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 15:29:28,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 15:29:28,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 15:29:28,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 15:29:28,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 15:29:28,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 15:29:28,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 15:29:28,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 15:29:28,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 15:29:28,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 15:29:28,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 15:29:28,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 15:29:28,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 15:29:28,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 15:29:28,340 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 15:29:28,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 15:29:28,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 15:29:28,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 15:29:28,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 15:29:28,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 15:29:28,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 15:29:28,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 15:29:28,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 15:29:28,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 15:29:28,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 15:29:28,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 15:29:28,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 15:29:28,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 15:29:28,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 15:29:28,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:29:28,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 15:29:28,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 15:29:28,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 15:29:28,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 15:29:28,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 15:29:28,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 15:29:28,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 15:29:28,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 15:29:28,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 15:29:28,348 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 -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2024-10-14 15:29:28,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 15:29:28,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 15:29:28,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 15:29:28,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 15:29:28,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 15:29:28,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-10-14 15:29:30,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 15:29:30,519 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 15:29:30,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-10-14 15:29:30,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6f64719/4fcdaf875b0c43b099de43df5ab1e9c9/FLAGb2794ddbe [2024-10-14 15:29:30,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6f64719/4fcdaf875b0c43b099de43df5ab1e9c9 [2024-10-14 15:29:30,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 15:29:30,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 15:29:30,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 15:29:30,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 15:29:30,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 15:29:30,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:29:30" (1/1) ... [2024-10-14 15:29:30,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc79730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:30, skipping insertion in model container [2024-10-14 15:29:30,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:29:30" (1/1) ... [2024-10-14 15:29:30,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 15:29:31,475 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2024-10-14 15:29:31,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:29:31,592 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 15:29:31,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6057] [2024-10-14 15:29:31,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6060] [2024-10-14 15:29:31,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6063] [2024-10-14 15:29:31,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6066] [2024-10-14 15:29:31,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6069] [2024-10-14 15:29:31,844 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2024-10-14 15:29:31,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 15:29:31,906 INFO L204 MainTranslator]: Completed translation [2024-10-14 15:29:31,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31 WrapperNode [2024-10-14 15:29:31,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 15:29:31,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 15:29:31,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 15:29:31,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 15:29:31,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:31,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:31,997 INFO L138 Inliner]: procedures = 68, calls = 171, calls flagged for inlining = 23, calls inlined = 16, statements flattened = 362 [2024-10-14 15:29:32,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 15:29:32,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 15:29:32,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 15:29:32,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 15:29:32,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,071 INFO L175 MemorySlicer]: Split 96 memory accesses to 7 slices as follows [1, 2, 4, 3, 9, 74, 3]. 77 percent of accesses are in the largest equivalence class. The 83 initializations are split as follows [0, 2, 0, 0, 4, 74, 3]. The 3 writes are split as follows [1, 0, 2, 0, 0, 0, 0]. [2024-10-14 15:29:32,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 15:29:32,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 15:29:32,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 15:29:32,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 15:29:32,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (1/1) ... [2024-10-14 15:29:32,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 15:29:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:32,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 15:29:32,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-14 15:29:32,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 15:29:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-14 15:29:32,272 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-14 15:29:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-14 15:29:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-14 15:29:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2024-10-14 15:29:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2024-10-14 15:29:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 15:29:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 15:29:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 15:29:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 15:29:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-14 15:29:32,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-10-14 15:29:32,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 15:29:32,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 15:29:32,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 15:29:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 15:29:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 15:29:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 15:29:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 15:29:32,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 15:29:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-10-14 15:29:32,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-10-14 15:29:32,579 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 15:29:32,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 15:29:32,606 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-14 15:29:33,005 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-14 15:29:33,005 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 15:29:33,075 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 15:29:33,075 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 15:29:33,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:29:33 BoogieIcfgContainer [2024-10-14 15:29:33,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 15:29:33,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 15:29:33,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 15:29:33,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 15:29:33,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:29:30" (1/3) ... [2024-10-14 15:29:33,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba86070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:29:33, skipping insertion in model container [2024-10-14 15:29:33,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:29:31" (2/3) ... [2024-10-14 15:29:33,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba86070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:29:33, skipping insertion in model container [2024-10-14 15:29:33,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:29:33" (3/3) ... [2024-10-14 15:29:33,085 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2024-10-14 15:29:33,102 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 15:29:33,102 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 15:29:33,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 15:29:33,201 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;@6ab1350c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 15:29:33,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 15:29:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 60 states have internal predecessors, (82), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 15:29:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 15:29:33,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:33,215 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:33,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:33,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash -849079906, now seen corresponding path program 1 times [2024-10-14 15:29:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877534029] [2024-10-14 15:29:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:29:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:33,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877534029] [2024-10-14 15:29:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877534029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 15:29:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347209128] [2024-10-14 15:29:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:33,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:29:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:29:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 15:29:33,873 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 60 states have internal predecessors, (82), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:29:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:34,143 INFO L93 Difference]: Finished difference Result 147 states and 211 transitions. [2024-10-14 15:29:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 15:29:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-10-14 15:29:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:34,157 INFO L225 Difference]: With dead ends: 147 [2024-10-14 15:29:34,157 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 15:29:34,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:29:34,165 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:34,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 217 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:29:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 15:29:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-10-14 15:29:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 15:29:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2024-10-14 15:29:34,221 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 49 [2024-10-14 15:29:34,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:34,221 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2024-10-14 15:29:34,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:29:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-10-14 15:29:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 15:29:34,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:34,224 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 15:29:34,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2136119706, now seen corresponding path program 1 times [2024-10-14 15:29:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226256744] [2024-10-14 15:29:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:29:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226256744] [2024-10-14 15:29:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226256744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:29:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485336322] [2024-10-14 15:29:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:34,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:29:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:29:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:29:34,556 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:34,806 INFO L93 Difference]: Finished difference Result 151 states and 215 transitions. [2024-10-14 15:29:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 15:29:34,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-10-14 15:29:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:34,808 INFO L225 Difference]: With dead ends: 151 [2024-10-14 15:29:34,809 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 15:29:34,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 15:29:34,810 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 97 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:34,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 243 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:29:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 15:29:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-10-14 15:29:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 87 states have internal predecessors, (125), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 15:29:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2024-10-14 15:29:34,826 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 49 [2024-10-14 15:29:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2024-10-14 15:29:34,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2024-10-14 15:29:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 15:29:34,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:34,831 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:34,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 15:29:34,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1855662100, now seen corresponding path program 1 times [2024-10-14 15:29:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051516195] [2024-10-14 15:29:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:29:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051516195] [2024-10-14 15:29:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051516195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:35,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:35,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:29:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455675151] [2024-10-14 15:29:35,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:35,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:29:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:29:35,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:29:35,033 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:35,251 INFO L93 Difference]: Finished difference Result 115 states and 155 transitions. [2024-10-14 15:29:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 15:29:35,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2024-10-14 15:29:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:35,253 INFO L225 Difference]: With dead ends: 115 [2024-10-14 15:29:35,253 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 15:29:35,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 15:29:35,255 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 111 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:35,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 206 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:35,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 15:29:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2024-10-14 15:29:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 15:29:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2024-10-14 15:29:35,266 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 52 [2024-10-14 15:29:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:35,266 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2024-10-14 15:29:35,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2024-10-14 15:29:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 15:29:35,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:35,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 15:29:35,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1798403798, now seen corresponding path program 1 times [2024-10-14 15:29:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956891442] [2024-10-14 15:29:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:29:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956891442] [2024-10-14 15:29:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956891442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:29:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820984957] [2024-10-14 15:29:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:29:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:29:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:29:35,502 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:29:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:35,716 INFO L93 Difference]: Finished difference Result 260 states and 375 transitions. [2024-10-14 15:29:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 15:29:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2024-10-14 15:29:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:35,718 INFO L225 Difference]: With dead ends: 260 [2024-10-14 15:29:35,718 INFO L226 Difference]: Without dead ends: 179 [2024-10-14 15:29:35,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 15:29:35,719 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 130 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:35,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 192 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-14 15:29:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2024-10-14 15:29:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 153 states have internal predecessors, (223), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 15:29:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 245 transitions. [2024-10-14 15:29:35,747 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 245 transitions. Word has length 52 [2024-10-14 15:29:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:35,748 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 245 transitions. [2024-10-14 15:29:35,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:29:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 245 transitions. [2024-10-14 15:29:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 15:29:35,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:35,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:35,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 15:29:35,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:35,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2079126732, now seen corresponding path program 1 times [2024-10-14 15:29:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:35,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987491201] [2024-10-14 15:29:35,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:35,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:29:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987491201] [2024-10-14 15:29:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987491201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:35,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:35,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:29:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713130655] [2024-10-14 15:29:35,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:35,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:29:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:29:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:29:35,928 INFO L87 Difference]: Start difference. First operand 173 states and 245 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:36,124 INFO L93 Difference]: Finished difference Result 385 states and 555 transitions. [2024-10-14 15:29:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 15:29:36,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2024-10-14 15:29:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:36,128 INFO L225 Difference]: With dead ends: 385 [2024-10-14 15:29:36,128 INFO L226 Difference]: Without dead ends: 236 [2024-10-14 15:29:36,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 15:29:36,132 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 94 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:36,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 208 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-14 15:29:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2024-10-14 15:29:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 208 states have (on average 1.4567307692307692) internal successors, (303), 209 states have internal predecessors, (303), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 15:29:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 325 transitions. [2024-10-14 15:29:36,162 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 325 transitions. Word has length 58 [2024-10-14 15:29:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:36,162 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 325 transitions. [2024-10-14 15:29:36,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 325 transitions. [2024-10-14 15:29:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 15:29:36,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:36,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 15:29:36,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash 238013440, now seen corresponding path program 1 times [2024-10-14 15:29:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56223163] [2024-10-14 15:29:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 15:29:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56223163] [2024-10-14 15:29:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56223163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:36,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:36,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 15:29:36,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245588788] [2024-10-14 15:29:36,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:36,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:29:36,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:29:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:29:36,631 INFO L87 Difference]: Start difference. First operand 229 states and 325 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:36,831 INFO L93 Difference]: Finished difference Result 440 states and 633 transitions. [2024-10-14 15:29:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 15:29:36,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 67 [2024-10-14 15:29:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:36,833 INFO L225 Difference]: With dead ends: 440 [2024-10-14 15:29:36,833 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 15:29:36,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 15:29:36,835 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 35 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:36,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 292 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:29:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 15:29:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-10-14 15:29:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 212 states have (on average 1.4386792452830188) internal successors, (305), 213 states have internal predecessors, (305), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 15:29:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-10-14 15:29:36,861 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 67 [2024-10-14 15:29:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:36,861 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-10-14 15:29:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-10-14 15:29:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 15:29:36,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:36,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 15:29:36,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:36,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash -571333186, now seen corresponding path program 1 times [2024-10-14 15:29:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34453793] [2024-10-14 15:29:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 15:29:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34453793] [2024-10-14 15:29:37,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34453793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:29:37,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295351194] [2024-10-14 15:29:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:37,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:37,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:37,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:29:37,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 15:29:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 15:29:37,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:29:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 15:29:37,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:29:37,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295351194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:37,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:29:37,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-14 15:29:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470237360] [2024-10-14 15:29:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:37,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 15:29:37,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:37,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 15:29:37,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:29:37,418 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:37,456 INFO L93 Difference]: Finished difference Result 431 states and 616 transitions. [2024-10-14 15:29:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 15:29:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 67 [2024-10-14 15:29:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:37,458 INFO L225 Difference]: With dead ends: 431 [2024-10-14 15:29:37,458 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 15:29:37,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:29:37,460 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:37,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 15:29:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 15:29:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-10-14 15:29:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 205 states have (on average 1.4341463414634146) internal successors, (294), 206 states have internal predecessors, (294), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 15:29:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 312 transitions. [2024-10-14 15:29:37,470 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 312 transitions. Word has length 67 [2024-10-14 15:29:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:37,470 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 312 transitions. [2024-10-14 15:29:37,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 312 transitions. [2024-10-14 15:29:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 15:29:37,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:37,472 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:37,491 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-14 15:29:37,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:37,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:37,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1559307973, now seen corresponding path program 1 times [2024-10-14 15:29:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:37,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952677538] [2024-10-14 15:29:37,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 15:29:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952677538] [2024-10-14 15:29:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952677538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 15:29:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887037710] [2024-10-14 15:29:37,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:37,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:29:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:37,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:29:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:29:37,994 INFO L87 Difference]: Start difference. First operand 222 states and 312 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:29:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:38,247 INFO L93 Difference]: Finished difference Result 337 states and 479 transitions. [2024-10-14 15:29:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 15:29:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-14 15:29:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:38,250 INFO L225 Difference]: With dead ends: 337 [2024-10-14 15:29:38,250 INFO L226 Difference]: Without dead ends: 334 [2024-10-14 15:29:38,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 15:29:38,251 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 139 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:38,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 430 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:29:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-14 15:29:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 327. [2024-10-14 15:29:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 306 states have (on average 1.4477124183006536) internal successors, (443), 307 states have internal predecessors, (443), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 15:29:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 467 transitions. [2024-10-14 15:29:38,266 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 467 transitions. Word has length 68 [2024-10-14 15:29:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:38,266 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 467 transitions. [2024-10-14 15:29:38,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 15:29:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 467 transitions. [2024-10-14 15:29:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 15:29:38,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:38,268 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 15:29:38,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1977666942, now seen corresponding path program 1 times [2024-10-14 15:29:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476597844] [2024-10-14 15:29:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 15:29:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476597844] [2024-10-14 15:29:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476597844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:38,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:38,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 15:29:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702555864] [2024-10-14 15:29:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 15:29:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 15:29:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 15:29:38,418 INFO L87 Difference]: Start difference. First operand 327 states and 467 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:38,579 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2024-10-14 15:29:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:29:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-10-14 15:29:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:38,581 INFO L225 Difference]: With dead ends: 547 [2024-10-14 15:29:38,582 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 15:29:38,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:29:38,583 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:38,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 247 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 15:29:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-14 15:29:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 306 states have (on average 1.434640522875817) internal successors, (439), 307 states have internal predecessors, (439), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 15:29:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 463 transitions. [2024-10-14 15:29:38,597 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 463 transitions. Word has length 73 [2024-10-14 15:29:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 463 transitions. [2024-10-14 15:29:38,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 463 transitions. [2024-10-14 15:29:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 15:29:38,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:38,599 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 15:29:38,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1390860928, now seen corresponding path program 1 times [2024-10-14 15:29:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925461492] [2024-10-14 15:29:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 15:29:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925461492] [2024-10-14 15:29:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925461492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:38,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 15:29:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893231552] [2024-10-14 15:29:38,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:38,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:29:38,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:38,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:29:38,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 15:29:38,985 INFO L87 Difference]: Start difference. First operand 327 states and 463 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:39,170 INFO L93 Difference]: Finished difference Result 547 states and 780 transitions. [2024-10-14 15:29:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 15:29:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-10-14 15:29:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:39,173 INFO L225 Difference]: With dead ends: 547 [2024-10-14 15:29:39,173 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 15:29:39,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 15:29:39,175 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 35 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:39,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 292 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 15:29:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-10-14 15:29:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 306 states have (on average 1.4215686274509804) internal successors, (435), 307 states have internal predecessors, (435), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 15:29:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 459 transitions. [2024-10-14 15:29:39,188 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 459 transitions. Word has length 73 [2024-10-14 15:29:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:39,189 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 459 transitions. [2024-10-14 15:29:39,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 15:29:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 459 transitions. [2024-10-14 15:29:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 15:29:39,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:39,190 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:39,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 15:29:39,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:39,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1191149884, now seen corresponding path program 1 times [2024-10-14 15:29:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:39,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015209361] [2024-10-14 15:29:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 15:29:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 15:29:39,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:39,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015209361] [2024-10-14 15:29:39,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015209361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:29:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861208758] [2024-10-14 15:29:39,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:39,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:29:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 15:29:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:39,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 15:29:39,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:29:39,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-14 15:29:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-14 15:29:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 15:29:39,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:29:39,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861208758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:39,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:29:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-14 15:29:39,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961598589] [2024-10-14 15:29:39,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:39,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 15:29:39,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 15:29:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 15:29:39,996 INFO L87 Difference]: Start difference. First operand 327 states and 459 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:29:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:40,122 INFO L93 Difference]: Finished difference Result 648 states and 915 transitions. [2024-10-14 15:29:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 15:29:40,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2024-10-14 15:29:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:40,124 INFO L225 Difference]: With dead ends: 648 [2024-10-14 15:29:40,124 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 15:29:40,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 15:29:40,125 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:40,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 15:29:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2024-10-14 15:29:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 318 states have (on average 1.4056603773584906) internal successors, (447), 319 states have internal predecessors, (447), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 15:29:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 471 transitions. [2024-10-14 15:29:40,137 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 471 transitions. Word has length 79 [2024-10-14 15:29:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:40,137 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 471 transitions. [2024-10-14 15:29:40,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:29:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 471 transitions. [2024-10-14 15:29:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 15:29:40,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:40,138 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:40,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 15:29:40,339 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,SelfDestructingSolverStorable10 [2024-10-14 15:29:40,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:40,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1933858300, now seen corresponding path program 1 times [2024-10-14 15:29:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:40,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746427903] [2024-10-14 15:29:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 15:29:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 15:29:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 15:29:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746427903] [2024-10-14 15:29:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746427903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:29:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476719788] [2024-10-14 15:29:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:40,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:40,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:40,671 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-14 15:29:40,673 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-14 15:29:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:40,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 15:29:40,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:29:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 15:29:41,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:29:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476719788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:41,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:29:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-14 15:29:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799292642] [2024-10-14 15:29:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:41,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:29:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:29:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:29:41,003 INFO L87 Difference]: Start difference. First operand 339 states and 471 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:29:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:41,058 INFO L93 Difference]: Finished difference Result 662 states and 926 transitions. [2024-10-14 15:29:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 15:29:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2024-10-14 15:29:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:41,061 INFO L225 Difference]: With dead ends: 662 [2024-10-14 15:29:41,061 INFO L226 Difference]: Without dead ends: 340 [2024-10-14 15:29:41,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:29:41,062 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:41,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 15:29:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-14 15:29:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-10-14 15:29:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 319 states have (on average 1.4043887147335423) internal successors, (448), 320 states have internal predecessors, (448), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 15:29:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 472 transitions. [2024-10-14 15:29:41,077 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 472 transitions. Word has length 79 [2024-10-14 15:29:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 472 transitions. [2024-10-14 15:29:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:29:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 472 transitions. [2024-10-14 15:29:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 15:29:41,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:41,079 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:41,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 15:29:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:41,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -311734896, now seen corresponding path program 1 times [2024-10-14 15:29:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157721800] [2024-10-14 15:29:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 15:29:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 15:29:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 15:29:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157721800] [2024-10-14 15:29:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157721800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:29:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359719307] [2024-10-14 15:29:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:41,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:41,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:41,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:29:41,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 15:29:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:42,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 15:29:42,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:29:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 15:29:42,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 15:29:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 15:29:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359719307] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 15:29:42,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 15:29:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-14 15:29:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581768321] [2024-10-14 15:29:42,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 15:29:42,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 15:29:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 15:29:42,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-14 15:29:42,222 INFO L87 Difference]: Start difference. First operand 340 states and 472 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 15:29:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:42,618 INFO L93 Difference]: Finished difference Result 671 states and 938 transitions. [2024-10-14 15:29:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 15:29:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2024-10-14 15:29:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:42,622 INFO L225 Difference]: With dead ends: 671 [2024-10-14 15:29:42,622 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 15:29:42,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2024-10-14 15:29:42,624 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 86 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:42,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 15:29:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 15:29:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-14 15:29:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 327 states have internal predecessors, (453), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-14 15:29:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2024-10-14 15:29:42,638 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 81 [2024-10-14 15:29:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:42,638 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2024-10-14 15:29:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 15:29:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2024-10-14 15:29:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 15:29:42,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:42,640 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:42,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 15:29:42,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:42,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1526914300, now seen corresponding path program 2 times [2024-10-14 15:29:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481319240] [2024-10-14 15:29:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:29:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 15:29:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 15:29:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481319240] [2024-10-14 15:29:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481319240] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:29:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287984184] [2024-10-14 15:29:45,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 15:29:45,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:45,011 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:29:45,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 15:29:45,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 15:29:45,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 15:29:45,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 15:29:45,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:29:45,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 71 [2024-10-14 15:29:45,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2024-10-14 15:29:45,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-14 15:29:45,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 15:29:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 15:29:45,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:29:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287984184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:29:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-10-14 15:29:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371395819] [2024-10-14 15:29:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 15:29:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 15:29:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-10-14 15:29:45,633 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:29:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:45,758 INFO L93 Difference]: Finished difference Result 502 states and 683 transitions. [2024-10-14 15:29:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 15:29:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-10-14 15:29:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:45,761 INFO L225 Difference]: With dead ends: 502 [2024-10-14 15:29:45,761 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 15:29:45,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-10-14 15:29:45,762 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:45,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 441 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 15:29:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 248. [2024-10-14 15:29:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 229 states have (on average 1.3624454148471616) internal successors, (312), 230 states have internal predecessors, (312), 12 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 15:29:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 334 transitions. [2024-10-14 15:29:45,783 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 334 transitions. Word has length 87 [2024-10-14 15:29:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:45,784 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 334 transitions. [2024-10-14 15:29:45,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 15:29:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 334 transitions. [2024-10-14 15:29:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 15:29:45,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:45,788 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:45,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 15:29:45,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 15:29:45,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:45,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1284904852, now seen corresponding path program 1 times [2024-10-14 15:29:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:45,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565217545] [2024-10-14 15:29:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:29:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 15:29:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 15:29:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565217545] [2024-10-14 15:29:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565217545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:46,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 15:29:46,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 15:29:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707676825] [2024-10-14 15:29:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 15:29:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 15:29:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 15:29:46,477 INFO L87 Difference]: Start difference. First operand 248 states and 334 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 15:29:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:46,724 INFO L93 Difference]: Finished difference Result 250 states and 335 transitions. [2024-10-14 15:29:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 15:29:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 89 [2024-10-14 15:29:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:46,727 INFO L225 Difference]: With dead ends: 250 [2024-10-14 15:29:46,727 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 15:29:46,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-10-14 15:29:46,730 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:46,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 15:29:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-14 15:29:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 227 states have (on average 1.3480176211453745) internal successors, (306), 227 states have internal predecessors, (306), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 15:29:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 327 transitions. [2024-10-14 15:29:46,745 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 327 transitions. Word has length 89 [2024-10-14 15:29:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:46,746 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 327 transitions. [2024-10-14 15:29:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 15:29:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 327 transitions. [2024-10-14 15:29:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 15:29:46,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 15:29:46,747 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-14 15:29:46,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 15:29:46,748 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 15:29:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 15:29:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1773004973, now seen corresponding path program 1 times [2024-10-14 15:29:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 15:29:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456324940] [2024-10-14 15:29:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 15:29:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 15:29:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 15:29:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 15:29:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 15:29:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 15:29:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 15:29:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 15:29:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 15:29:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456324940] [2024-10-14 15:29:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456324940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 15:29:47,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958616187] [2024-10-14 15:29:47,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 15:29:47,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 15:29:47,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 15:29:47,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 15:29:47,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 15:29:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 15:29:47,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 15:29:47,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 15:29:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 15:29:47,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 15:29:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958616187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 15:29:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 15:29:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2024-10-14 15:29:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982327751] [2024-10-14 15:29:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 15:29:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 15:29:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 15:29:47,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 15:29:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:29:47,505 INFO L87 Difference]: Start difference. First operand 245 states and 327 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 15:29:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 15:29:47,569 INFO L93 Difference]: Finished difference Result 245 states and 327 transitions. [2024-10-14 15:29:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 15:29:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 99 [2024-10-14 15:29:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 15:29:47,570 INFO L225 Difference]: With dead ends: 245 [2024-10-14 15:29:47,570 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 15:29:47,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 15:29:47,571 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 58 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 15:29:47,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 117 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 15:29:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 15:29:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 15:29:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 15:29:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 15:29:47,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-10-14 15:29:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 15:29:47,572 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 15:29:47,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 15:29:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 15:29:47,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 15:29:47,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 15:29:47,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 15:29:47,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 15:29:47,780 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 15:29:47,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 15:29:49,462 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 15:29:49,474 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_module_refcounter~0 [2024-10-14 15:29:49,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-14 15:29:49,475 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_retval_0~0 [2024-10-14 15:29:49,480 WARN L155 FloydHoareUtils]: Requires clause for ldv_module_put contained old-variable. Original clause: (and (<= |old(~ldv_module_refcounter~0)| 2) (= 2 ~ldv_module_refcounter~0) (<= 2 |old(~ldv_module_refcounter~0)|) (= ~ldv_retval_0~0 0)) Eliminated clause: (and (= 2 ~ldv_module_refcounter~0) (= ~ldv_retval_0~0 0)) [2024-10-14 15:29:49,483 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~module!offset [2024-10-14 15:29:49,485 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~module!base [2024-10-14 15:29:49,488 WARN L155 FloydHoareUtils]: Requires clause for ldv_init_zalloc contained old-variable. Original clause: (and (= ~ldv_module_refcounter~0 1) (= |old(#length)| |#length|) (= |#memory_int#0| |old(#memory_int#0)|) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0) (= |old(#valid)| |#valid|)) Eliminated clause: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2024-10-14 15:29:49,492 WARN L155 FloydHoareUtils]: Requires clause for ldv_memset contained old-variable. Original clause: (and (= ~ldv_module_refcounter~0 1) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) Eliminated clause: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2024-10-14 15:29:49,494 WARN L155 FloydHoareUtils]: Requires clause for #Ultimate.meminit contained old-variable. Original clause: (and (= ~ldv_module_refcounter~0 1) (= |#memory_int#0| |old(#memory_int#0)|) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) Eliminated clause: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2024-10-14 15:29:49,496 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_module_refcounter~0 [2024-10-14 15:29:49,496 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-14 15:29:49,496 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_retval_0~0 [2024-10-14 15:29:49,496 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_module_refcounter~0 [2024-10-14 15:29:49,496 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-14 15:29:49,496 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_retval_0~0 [2024-10-14 15:29:49,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:29:49 BoogieIcfgContainer [2024-10-14 15:29:49,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 15:29:49,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 15:29:49,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 15:29:49,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 15:29:49,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:29:33" (3/4) ... [2024-10-14 15:29:49,501 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 15:29:49,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-14 15:29:49,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2024-10-14 15:29:49,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2024-10-14 15:29:49,505 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2024-10-14 15:29:49,506 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 15:29:49,506 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2024-10-14 15:29:49,506 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2024-10-14 15:29:49,519 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2024-10-14 15:29:49,520 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-14 15:29:49,521 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 15:29:49,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 15:29:49,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 15:29:49,651 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 15:29:49,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 15:29:49,651 INFO L158 Benchmark]: Toolchain (without parser) took 19052.09ms. Allocated memory was 167.8MB in the beginning and 639.6MB in the end (delta: 471.9MB). Free memory was 125.1MB in the beginning and 329.5MB in the end (delta: -204.4MB). Peak memory consumption was 268.5MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,652 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 15:29:49,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1305.90ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 103.0MB in the end (delta: 22.1MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.55ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 99.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,653 INFO L158 Benchmark]: Boogie Preprocessor took 116.64ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 93.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,653 INFO L158 Benchmark]: RCFGBuilder took 956.67ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 71.4MB in the end (delta: 22.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,653 INFO L158 Benchmark]: TraceAbstraction took 16418.53ms. Allocated memory was 167.8MB in the beginning and 639.6MB in the end (delta: 471.9MB). Free memory was 70.6MB in the beginning and 340.0MB in the end (delta: -269.4MB). Peak memory consumption was 275.6MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,654 INFO L158 Benchmark]: Witness Printer took 153.51ms. Allocated memory is still 639.6MB. Free memory was 340.0MB in the beginning and 329.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 15:29:49,655 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1305.90ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 103.0MB in the end (delta: 22.1MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.55ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 99.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.64ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 93.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 956.67ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 71.4MB in the end (delta: 22.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16418.53ms. Allocated memory was 167.8MB in the beginning and 639.6MB in the end (delta: 471.9MB). Free memory was 70.6MB in the beginning and 340.0MB in the end (delta: -269.4MB). Peak memory consumption was 275.6MB. Max. memory is 16.1GB. * Witness Printer took 153.51ms. Allocated memory is still 639.6MB. Free memory was 340.0MB in the beginning and 329.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 6057]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6057] - GenericResultAtLocation [Line: 6060]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6060] - GenericResultAtLocation [Line: 6063]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6063] - GenericResultAtLocation [Line: 6066]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6066] - GenericResultAtLocation [Line: 6069]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6069] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_module_refcounter~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_retval_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~module!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~module!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_module_refcounter~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_retval_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_module_refcounter~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_retval_0~0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6264]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 971 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 4082 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3030 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1808 IncrementalHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 1052 mSDtfsCounter, 1808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 972 GetRequests, 814 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 62 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1614 NumberOfCodeBlocks, 1614 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1672 ConstructedInterpolants, 0 QuantifiedInterpolants, 3818 SizeOfPredicates, 16 NumberOfNonLiveVariables, 4604 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 711/740 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5929]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 6260]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 6331]: Procedure Contract for ldv_module_put Derived contract for procedure ldv_module_put. Requires: ((2 == ldv_module_refcounter) && (ldv_retval_0 == 0)) Ensures: (((2 == \old(ldv_module_refcounter)) && (ldv_retval_0 == 0)) && ((ldv_module_refcounter == 1) || (2 == ldv_module_refcounter))) - ProcedureContractResult [Line: 5894]: Procedure Contract for ldv_init_zalloc Derived contract for procedure ldv_init_zalloc. Requires: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) Ensures: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) - ProcedureContractResult [Line: 5857]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) Ensures: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) - ProcedureContractResult [Line: 5905]: Procedure Contract for ldv_memset Derived contract for procedure ldv_memset. Requires: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) Ensures: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-14 15:29:49,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE