/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:38:23,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:38:23,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:38:23,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:38:23,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:38:23,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:38:23,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:38:23,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:38:23,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:38:23,567 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:38:23,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:38:23,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:38:23,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:38:23,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:38:23,568 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:38:23,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:38:23,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:38:23,569 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:38:23,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:38:23,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:38:23,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:38:23,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:38:23,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:38:23,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:38:23,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:38:23,571 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:38:23,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:38:23,571 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:38:23,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:38:23,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:38:23,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:38:23,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:38:23,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:38:23,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:38:23,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:38:23,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:38:23,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:38:23,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:38:23,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:38:23,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:38:23,573 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:38:23,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:38:23,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:38:23,574 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: Use bitabs translation -> true [2023-12-15 21:38:23,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:38:23,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:38:23,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:38:23,719 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:38:23,719 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:38:23,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-15 21:38:24,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:38:24,851 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:38:24,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i [2023-12-15 21:38:24,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55a74889/c001e51e214245e9a60353dd37b02464/FLAG680e79cac [2023-12-15 21:38:24,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55a74889/c001e51e214245e9a60353dd37b02464 [2023-12-15 21:38:24,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:38:24,873 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:38:24,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:38:24,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:38:24,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:38:24,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:38:24" (1/1) ... [2023-12-15 21:38:24,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212c3d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:24, skipping insertion in model container [2023-12-15 21:38:24,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:38:24" (1/1) ... [2023-12-15 21:38:24,898 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:38:24,999 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-12-15 21:38:25,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:38:25,042 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:38:25,050 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-76.i[916,929] [2023-12-15 21:38:25,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:38:25,079 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:38:25,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25 WrapperNode [2023-12-15 21:38:25,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:38:25,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:38:25,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:38:25,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:38:25,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,123 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 444 [2023-12-15 21:38:25,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:38:25,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:38:25,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:38:25,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:38:25,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,157 INFO L175 MemorySlicer]: Split 107 memory accesses to 13 slices as follows [2, 11, 6, 6, 14, 3, 12, 12, 10, 10, 6, 7, 8]. 13 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1]. [2023-12-15 21:38:25,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:38:25,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:38:25,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:38:25,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:38:25,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (1/1) ... [2023-12-15 21:38:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:38:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:38:25,237 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) [2023-12-15 21:38:25,266 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 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:38:25,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-15 21:38:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-15 21:38:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2023-12-15 21:38:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2023-12-15 21:38:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2023-12-15 21:38:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2023-12-15 21:38:25,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-15 21:38:25,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2023-12-15 21:38:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-15 21:38:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2023-12-15 21:38:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:38:25,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-15 21:38:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-15 21:38:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-15 21:38:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-15 21:38:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-15 21:38:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-15 21:38:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:38:25,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:38:25,410 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:38:25,411 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:38:25,703 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:38:25,732 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:38:25,733 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:38:25,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:38:25 BoogieIcfgContainer [2023-12-15 21:38:25,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:38:25,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:38:25,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:38:25,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:38:25,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:38:24" (1/3) ... [2023-12-15 21:38:25,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6404bb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:38:25, skipping insertion in model container [2023-12-15 21:38:25,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:38:25" (2/3) ... [2023-12-15 21:38:25,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6404bb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:38:25, skipping insertion in model container [2023-12-15 21:38:25,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:38:25" (3/3) ... [2023-12-15 21:38:25,743 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-76.i [2023-12-15 21:38:25,756 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:38:25,756 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:38:25,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:38:25,809 INFO L357 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, mHoare=true, 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;@7cdba3c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:38:25,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:38:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:38:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:38:25,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:25,821 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:25,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:25,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash -325546568, now seen corresponding path program 1 times [2023-12-15 21:38:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342952657] [2023-12-15 21:38:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:26,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:26,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342952657] [2023-12-15 21:38:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342952657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:38:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848620360] [2023-12-15 21:38:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:26,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:38:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:26,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:38:26,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:38:26,271 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:38:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:26,308 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-15 21:38:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:38:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-12-15 21:38:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:26,317 INFO L225 Difference]: With dead ends: 183 [2023-12-15 21:38:26,318 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:38:26,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:38:26,324 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:26,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:38:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-15 21:38:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:38:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-12-15 21:38:26,387 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-12-15 21:38:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:26,387 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-12-15 21:38:26,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:38:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-12-15 21:38:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:38:26,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:26,398 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:26,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:38:26,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:26,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -748288644, now seen corresponding path program 1 times [2023-12-15 21:38:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965994099] [2023-12-15 21:38:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965994099] [2023-12-15 21:38:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965994099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:26,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:38:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889907737] [2023-12-15 21:38:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:26,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:38:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:38:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:26,703 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:26,738 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-12-15 21:38:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:38:26,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-12-15 21:38:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:26,740 INFO L225 Difference]: With dead ends: 177 [2023-12-15 21:38:26,741 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:38:26,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:26,742 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:26,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:38:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-15 21:38:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:38:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-12-15 21:38:26,755 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-12-15 21:38:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:26,757 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-12-15 21:38:26,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-12-15 21:38:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:38:26,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:26,758 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:26,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:38:26,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:26,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash -104011146, now seen corresponding path program 1 times [2023-12-15 21:38:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987310325] [2023-12-15 21:38:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:27,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987310325] [2023-12-15 21:38:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987310325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:38:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071961955] [2023-12-15 21:38:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:27,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:38:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:38:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:38:27,459 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-15 21:38:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:27,735 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2023-12-15 21:38:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:38:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2023-12-15 21:38:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:27,740 INFO L225 Difference]: With dead ends: 237 [2023-12-15 21:38:27,740 INFO L226 Difference]: Without dead ends: 149 [2023-12-15 21:38:27,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:38:27,745 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 270 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:27,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 624 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:38:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-15 21:38:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2023-12-15 21:38:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 125 states have internal predecessors, (169), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:38:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 207 transitions. [2023-12-15 21:38:27,760 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 207 transitions. Word has length 115 [2023-12-15 21:38:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:27,760 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 207 transitions. [2023-12-15 21:38:27,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-15 21:38:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 207 transitions. [2023-12-15 21:38:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:38:27,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:27,762 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:27,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:38:27,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:27,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 713637304, now seen corresponding path program 1 times [2023-12-15 21:38:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:27,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396005162] [2023-12-15 21:38:27,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:27,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396005162] [2023-12-15 21:38:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396005162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:27,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:27,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:38:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145203096] [2023-12-15 21:38:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:27,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:38:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:38:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:27,866 INFO L87 Difference]: Start difference. First operand 146 states and 207 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:27,880 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2023-12-15 21:38:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:38:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-12-15 21:38:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:27,882 INFO L225 Difference]: With dead ends: 246 [2023-12-15 21:38:27,882 INFO L226 Difference]: Without dead ends: 101 [2023-12-15 21:38:27,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:27,883 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 24 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:27,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 216 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-15 21:38:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-15 21:38:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 80 states have internal predecessors, (102), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:38:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2023-12-15 21:38:27,890 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 115 [2023-12-15 21:38:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:27,891 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2023-12-15 21:38:27,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2023-12-15 21:38:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:38:27,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:27,892 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:27,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:38:27,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:27,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash -800207029, now seen corresponding path program 1 times [2023-12-15 21:38:27,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:27,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946331074] [2023-12-15 21:38:27,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:27,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946331074] [2023-12-15 21:38:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946331074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:28,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:28,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:28,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094640936] [2023-12-15 21:38:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:28,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:28,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:28,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:28,098 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:28,139 INFO L93 Difference]: Finished difference Result 212 states and 294 transitions. [2023-12-15 21:38:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:38:28,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-12-15 21:38:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:28,141 INFO L225 Difference]: With dead ends: 212 [2023-12-15 21:38:28,141 INFO L226 Difference]: Without dead ends: 120 [2023-12-15 21:38:28,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:38:28,142 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:28,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 477 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-15 21:38:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2023-12-15 21:38:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:38:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2023-12-15 21:38:28,156 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 117 [2023-12-15 21:38:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:28,156 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2023-12-15 21:38:28,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2023-12-15 21:38:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:38:28,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:28,157 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:28,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:38:28,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:28,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -868922403, now seen corresponding path program 1 times [2023-12-15 21:38:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106171839] [2023-12-15 21:38:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106171839] [2023-12-15 21:38:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106171839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:38:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048455440] [2023-12-15 21:38:28,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:28,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:38:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:28,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:38:28,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:28,371 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:28,442 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2023-12-15 21:38:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:38:28,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:38:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:28,443 INFO L225 Difference]: With dead ends: 235 [2023-12-15 21:38:28,443 INFO L226 Difference]: Without dead ends: 140 [2023-12-15 21:38:28,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:38:28,445 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:28,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 638 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-15 21:38:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2023-12-15 21:38:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:38:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2023-12-15 21:38:28,459 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 119 [2023-12-15 21:38:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:28,459 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2023-12-15 21:38:28,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2023-12-15 21:38:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:38:28,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:28,462 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:28,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:38:28,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:28,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash -444346526, now seen corresponding path program 1 times [2023-12-15 21:38:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234564986] [2023-12-15 21:38:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234564986] [2023-12-15 21:38:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234564986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731961152] [2023-12-15 21:38:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:28,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:28,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:28,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:28,681 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:28,795 INFO L93 Difference]: Finished difference Result 320 states and 437 transitions. [2023-12-15 21:38:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:38:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-15 21:38:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:28,796 INFO L225 Difference]: With dead ends: 320 [2023-12-15 21:38:28,796 INFO L226 Difference]: Without dead ends: 224 [2023-12-15 21:38:28,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:28,798 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 152 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:28,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 648 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-15 21:38:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 182. [2023-12-15 21:38:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 145 states have internal predecessors, (182), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:38:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 250 transitions. [2023-12-15 21:38:28,815 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 250 transitions. Word has length 121 [2023-12-15 21:38:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:28,816 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 250 transitions. [2023-12-15 21:38:28,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 250 transitions. [2023-12-15 21:38:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:38:28,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:28,817 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:28,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:38:28,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:28,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 434146884, now seen corresponding path program 1 times [2023-12-15 21:38:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136156374] [2023-12-15 21:38:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:28,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136156374] [2023-12-15 21:38:28,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136156374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:28,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:38:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166361988] [2023-12-15 21:38:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:38:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:38:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:38:28,941 INFO L87 Difference]: Start difference. First operand 182 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:28,966 INFO L93 Difference]: Finished difference Result 355 states and 487 transitions. [2023-12-15 21:38:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:38:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-15 21:38:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:28,967 INFO L225 Difference]: With dead ends: 355 [2023-12-15 21:38:28,967 INFO L226 Difference]: Without dead ends: 182 [2023-12-15 21:38:28,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:38:28,968 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:28,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 298 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-15 21:38:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-12-15 21:38:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2587412587412588) internal successors, (180), 145 states have internal predecessors, (180), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:38:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2023-12-15 21:38:28,981 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 121 [2023-12-15 21:38:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:28,981 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2023-12-15 21:38:28,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2023-12-15 21:38:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:38:28,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:28,983 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:28,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:38:28,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:28,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash -980362073, now seen corresponding path program 1 times [2023-12-15 21:38:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833727956] [2023-12-15 21:38:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833727956] [2023-12-15 21:38:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833727956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367944545] [2023-12-15 21:38:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:29,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:29,229 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:29,331 INFO L93 Difference]: Finished difference Result 359 states and 486 transitions. [2023-12-15 21:38:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:38:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-15 21:38:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:29,334 INFO L225 Difference]: With dead ends: 359 [2023-12-15 21:38:29,334 INFO L226 Difference]: Without dead ends: 186 [2023-12-15 21:38:29,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:29,335 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 109 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:29,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 526 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-15 21:38:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2023-12-15 21:38:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2517482517482517) internal successors, (179), 145 states have internal predecessors, (179), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:38:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2023-12-15 21:38:29,351 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 123 [2023-12-15 21:38:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:29,351 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2023-12-15 21:38:29,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2023-12-15 21:38:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:38:29,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:29,352 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:29,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:38:29,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:29,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1514966570, now seen corresponding path program 1 times [2023-12-15 21:38:29,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917204752] [2023-12-15 21:38:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:29,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:38:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917204752] [2023-12-15 21:38:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917204752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:38:30,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408940812] [2023-12-15 21:38:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:30,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:38:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:38:30,154 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) [2023-12-15 21:38:30,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:38:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:30,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-15 21:38:30,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:38:30,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:38:30,689 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 223 treesize of output 167 [2023-12-15 21:38:30,694 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 167 treesize of output 143 [2023-12-15 21:38:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:38:30,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:38:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:30,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408940812] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:38:30,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:38:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 9] total 15 [2023-12-15 21:38:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805649340] [2023-12-15 21:38:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:30,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:38:30,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:38:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:38:30,972 INFO L87 Difference]: Start difference. First operand 182 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:31,142 INFO L93 Difference]: Finished difference Result 532 states and 719 transitions. [2023-12-15 21:38:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:38:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-15 21:38:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:31,144 INFO L225 Difference]: With dead ends: 532 [2023-12-15 21:38:31,144 INFO L226 Difference]: Without dead ends: 359 [2023-12-15 21:38:31,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:38:31,145 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 179 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:31,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 932 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-15 21:38:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 339. [2023-12-15 21:38:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 274 states have (on average 1.2554744525547445) internal successors, (344), 278 states have internal predecessors, (344), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-15 21:38:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 456 transitions. [2023-12-15 21:38:31,168 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 456 transitions. Word has length 123 [2023-12-15 21:38:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:31,169 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 456 transitions. [2023-12-15 21:38:31,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 456 transitions. [2023-12-15 21:38:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 21:38:31,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:31,170 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:31,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:38:31,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:38:31,377 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:31,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash 671553404, now seen corresponding path program 1 times [2023-12-15 21:38:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226293317] [2023-12-15 21:38:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:31,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226293317] [2023-12-15 21:38:31,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226293317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:31,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:31,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420424350] [2023-12-15 21:38:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:31,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:31,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:31,491 INFO L87 Difference]: Start difference. First operand 339 states and 456 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:31,557 INFO L93 Difference]: Finished difference Result 711 states and 951 transitions. [2023-12-15 21:38:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:38:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-12-15 21:38:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:31,559 INFO L225 Difference]: With dead ends: 711 [2023-12-15 21:38:31,560 INFO L226 Difference]: Without dead ends: 381 [2023-12-15 21:38:31,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:31,561 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 72 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:31,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 678 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-15 21:38:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 351. [2023-12-15 21:38:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 283 states have (on average 1.2402826855123674) internal successors, (351), 287 states have internal predecessors, (351), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-15 21:38:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 463 transitions. [2023-12-15 21:38:31,585 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 463 transitions. Word has length 124 [2023-12-15 21:38:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:31,585 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 463 transitions. [2023-12-15 21:38:31,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 463 transitions. [2023-12-15 21:38:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:38:31,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:31,587 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:38:31,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:31,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1401893715, now seen corresponding path program 1 times [2023-12-15 21:38:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690829498] [2023-12-15 21:38:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690829498] [2023-12-15 21:38:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690829498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:31,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:31,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:38:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695008313] [2023-12-15 21:38:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:31,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:38:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:38:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:31,668 INFO L87 Difference]: Start difference. First operand 351 states and 463 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:31,700 INFO L93 Difference]: Finished difference Result 693 states and 918 transitions. [2023-12-15 21:38:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:38:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-15 21:38:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:31,702 INFO L225 Difference]: With dead ends: 693 [2023-12-15 21:38:31,702 INFO L226 Difference]: Without dead ends: 355 [2023-12-15 21:38:31,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:31,703 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:31,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-15 21:38:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2023-12-15 21:38:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 287 states have (on average 1.2369337979094077) internal successors, (355), 291 states have internal predecessors, (355), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-15 21:38:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2023-12-15 21:38:31,726 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 125 [2023-12-15 21:38:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:31,726 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2023-12-15 21:38:31,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2023-12-15 21:38:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:38:31,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:31,727 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:31,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:38:31,727 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:31,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1204129839, now seen corresponding path program 1 times [2023-12-15 21:38:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:31,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058454645] [2023-12-15 21:38:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:31,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058454645] [2023-12-15 21:38:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058454645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:38:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128723683] [2023-12-15 21:38:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:32,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:38:32,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:38:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:38:32,146 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-15 21:38:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:32,432 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2023-12-15 21:38:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:38:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 125 [2023-12-15 21:38:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:32,434 INFO L225 Difference]: With dead ends: 700 [2023-12-15 21:38:32,434 INFO L226 Difference]: Without dead ends: 358 [2023-12-15 21:38:32,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:38:32,435 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:32,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 541 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:38:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-15 21:38:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2023-12-15 21:38:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.231578947368421) internal successors, (351), 289 states have internal predecessors, (351), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-15 21:38:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2023-12-15 21:38:32,458 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 125 [2023-12-15 21:38:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:32,458 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2023-12-15 21:38:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-15 21:38:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2023-12-15 21:38:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:38:32,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:32,459 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:32,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:38:32,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:32,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash -772063983, now seen corresponding path program 1 times [2023-12-15 21:38:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616503695] [2023-12-15 21:38:32,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616503695] [2023-12-15 21:38:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616503695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:32,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:32,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:38:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736191755] [2023-12-15 21:38:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:32,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:38:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:32,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:38:32,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:38:32,983 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-15 21:38:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:33,269 INFO L93 Difference]: Finished difference Result 530 states and 691 transitions. [2023-12-15 21:38:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:38:33,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2023-12-15 21:38:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:33,271 INFO L225 Difference]: With dead ends: 530 [2023-12-15 21:38:33,271 INFO L226 Difference]: Without dead ends: 528 [2023-12-15 21:38:33,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:38:33,272 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 211 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:33,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 582 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:38:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-15 21:38:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 394. [2023-12-15 21:38:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 318 states have (on average 1.2169811320754718) internal successors, (387), 322 states have internal predecessors, (387), 63 states have call successors, (63), 12 states have call predecessors, (63), 12 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-15 21:38:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 513 transitions. [2023-12-15 21:38:33,312 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 513 transitions. Word has length 125 [2023-12-15 21:38:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:33,312 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 513 transitions. [2023-12-15 21:38:33,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-12-15 21:38:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 513 transitions. [2023-12-15 21:38:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:38:33,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:33,313 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:33,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:38:33,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:33,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1452136592, now seen corresponding path program 1 times [2023-12-15 21:38:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023516525] [2023-12-15 21:38:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023516525] [2023-12-15 21:38:33,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023516525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:33,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:33,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:33,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460258989] [2023-12-15 21:38:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:33,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:33,415 INFO L87 Difference]: Start difference. First operand 394 states and 513 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:33,494 INFO L93 Difference]: Finished difference Result 756 states and 978 transitions. [2023-12-15 21:38:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:38:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-15 21:38:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:33,496 INFO L225 Difference]: With dead ends: 756 [2023-12-15 21:38:33,496 INFO L226 Difference]: Without dead ends: 402 [2023-12-15 21:38:33,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:33,497 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 79 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:33,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 493 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-12-15 21:38:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2023-12-15 21:38:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 314 states have (on average 1.2038216560509554) internal successors, (378), 318 states have internal predecessors, (378), 63 states have call successors, (63), 14 states have call predecessors, (63), 14 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-15 21:38:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2023-12-15 21:38:33,558 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 125 [2023-12-15 21:38:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:33,558 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2023-12-15 21:38:33,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2023-12-15 21:38:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 21:38:33,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:33,559 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:33,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:38:33,560 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:33,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1836143434, now seen corresponding path program 1 times [2023-12-15 21:38:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:33,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344590729] [2023-12-15 21:38:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:33,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344590729] [2023-12-15 21:38:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344590729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:33,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:38:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940004731] [2023-12-15 21:38:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:38:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:38:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:38:33,757 INFO L87 Difference]: Start difference. First operand 392 states and 504 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:33,936 INFO L93 Difference]: Finished difference Result 937 states and 1200 transitions. [2023-12-15 21:38:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:38:33,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-15 21:38:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:33,939 INFO L225 Difference]: With dead ends: 937 [2023-12-15 21:38:33,939 INFO L226 Difference]: Without dead ends: 585 [2023-12-15 21:38:33,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:38:33,940 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 223 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:33,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1251 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-15 21:38:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 555. [2023-12-15 21:38:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 457 states have (on average 1.2056892778993435) internal successors, (551), 463 states have internal predecessors, (551), 77 states have call successors, (77), 20 states have call predecessors, (77), 20 states have return successors, (77), 71 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-15 21:38:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 705 transitions. [2023-12-15 21:38:34,021 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 705 transitions. Word has length 126 [2023-12-15 21:38:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:34,021 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 705 transitions. [2023-12-15 21:38:34,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 705 transitions. [2023-12-15 21:38:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 21:38:34,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:34,023 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:38:34,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:34,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash 87084600, now seen corresponding path program 1 times [2023-12-15 21:38:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572224002] [2023-12-15 21:38:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:34,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572224002] [2023-12-15 21:38:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572224002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971046319] [2023-12-15 21:38:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:34,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:34,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:34,176 INFO L87 Difference]: Start difference. First operand 555 states and 705 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:34,320 INFO L93 Difference]: Finished difference Result 1138 states and 1446 transitions. [2023-12-15 21:38:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:38:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-15 21:38:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:34,323 INFO L225 Difference]: With dead ends: 1138 [2023-12-15 21:38:34,323 INFO L226 Difference]: Without dead ends: 623 [2023-12-15 21:38:34,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:34,325 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 127 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:34,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 774 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-15 21:38:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 583. [2023-12-15 21:38:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 469 states have (on average 1.1940298507462686) internal successors, (560), 475 states have internal predecessors, (560), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-15 21:38:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 742 transitions. [2023-12-15 21:38:34,383 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 742 transitions. Word has length 126 [2023-12-15 21:38:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:34,383 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 742 transitions. [2023-12-15 21:38:34,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 742 transitions. [2023-12-15 21:38:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 21:38:34,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:34,384 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:34,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:38:34,384 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:34,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash -393966798, now seen corresponding path program 1 times [2023-12-15 21:38:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:34,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788821849] [2023-12-15 21:38:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:38:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788821849] [2023-12-15 21:38:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788821849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:38:34,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446025416] [2023-12-15 21:38:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:34,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:38:34,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:38:34,684 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) [2023-12-15 21:38:34,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:38:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:34,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 21:38:34,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:38:35,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:38:35,282 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 23 [2023-12-15 21:38:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-15 21:38:35,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:38:35,468 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 27 [2023-12-15 21:38:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:38:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446025416] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:38:35,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:38:35,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2023-12-15 21:38:35,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815600329] [2023-12-15 21:38:35,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:38:35,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 21:38:35,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 21:38:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:38:35,510 INFO L87 Difference]: Start difference. First operand 583 states and 742 transitions. Second operand has 19 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) [2023-12-15 21:38:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:35,867 INFO L93 Difference]: Finished difference Result 1168 states and 1465 transitions. [2023-12-15 21:38:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:38:35,878 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) Word has length 127 [2023-12-15 21:38:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:35,881 INFO L225 Difference]: With dead ends: 1168 [2023-12-15 21:38:35,881 INFO L226 Difference]: Without dead ends: 625 [2023-12-15 21:38:35,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:38:35,882 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 695 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:35,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 481 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:38:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-12-15 21:38:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 611. [2023-12-15 21:38:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 490 states have (on average 1.1734693877551021) internal successors, (575), 496 states have internal predecessors, (575), 91 states have call successors, (91), 29 states have call predecessors, (91), 29 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-15 21:38:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 757 transitions. [2023-12-15 21:38:35,973 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 757 transitions. Word has length 127 [2023-12-15 21:38:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:35,975 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 757 transitions. [2023-12-15 21:38:35,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.5625) internal successors, (105), 18 states have internal predecessors, (105), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 9 states have call successors, (32) [2023-12-15 21:38:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 757 transitions. [2023-12-15 21:38:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 21:38:35,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:35,976 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:35,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:38:36,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-15 21:38:36,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:36,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2082910540, now seen corresponding path program 1 times [2023-12-15 21:38:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567432479] [2023-12-15 21:38:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567432479] [2023-12-15 21:38:36,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567432479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:36,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:36,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:38:36,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224779875] [2023-12-15 21:38:36,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:36,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:38:36,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:38:36,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:38:36,532 INFO L87 Difference]: Start difference. First operand 611 states and 757 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-15 21:38:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:36,786 INFO L93 Difference]: Finished difference Result 1133 states and 1400 transitions. [2023-12-15 21:38:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:38:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2023-12-15 21:38:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:36,789 INFO L225 Difference]: With dead ends: 1133 [2023-12-15 21:38:36,789 INFO L226 Difference]: Without dead ends: 545 [2023-12-15 21:38:36,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:38:36,790 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 171 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:36,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 382 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-15 21:38:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2023-12-15 21:38:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 424 states have (on average 1.150943396226415) internal successors, (488), 430 states have internal predecessors, (488), 91 states have call successors, (91), 29 states have call predecessors, (91), 29 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-15 21:38:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 670 transitions. [2023-12-15 21:38:36,839 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 670 transitions. Word has length 127 [2023-12-15 21:38:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:36,839 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 670 transitions. [2023-12-15 21:38:36,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-12-15 21:38:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 670 transitions. [2023-12-15 21:38:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-15 21:38:36,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:36,840 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:36,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:38:36,841 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:36,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash -213349927, now seen corresponding path program 1 times [2023-12-15 21:38:36,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:36,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22449130] [2023-12-15 21:38:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:36,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22449130] [2023-12-15 21:38:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22449130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:36,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:36,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433267954] [2023-12-15 21:38:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:36,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:36,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:36,983 INFO L87 Difference]: Start difference. First operand 545 states and 670 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:37,096 INFO L93 Difference]: Finished difference Result 826 states and 1007 transitions. [2023-12-15 21:38:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:38:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-12-15 21:38:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:37,097 INFO L225 Difference]: With dead ends: 826 [2023-12-15 21:38:37,098 INFO L226 Difference]: Without dead ends: 325 [2023-12-15 21:38:37,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:37,099 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 95 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:37,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 476 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-15 21:38:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 307. [2023-12-15 21:38:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.1265822784810127) internal successors, (267), 240 states have internal predecessors, (267), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 21:38:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 371 transitions. [2023-12-15 21:38:37,144 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 371 transitions. Word has length 127 [2023-12-15 21:38:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:37,144 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 371 transitions. [2023-12-15 21:38:37,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 371 transitions. [2023-12-15 21:38:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:38:37,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:37,145 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:37,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:38:37,145 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:37,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 383481696, now seen corresponding path program 1 times [2023-12-15 21:38:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267685103] [2023-12-15 21:38:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:37,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267685103] [2023-12-15 21:38:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267685103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:38:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986770368] [2023-12-15 21:38:37,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:37,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:38:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:38:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:37,206 INFO L87 Difference]: Start difference. First operand 307 states and 371 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:37,246 INFO L93 Difference]: Finished difference Result 582 states and 700 transitions. [2023-12-15 21:38:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:38:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-15 21:38:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:37,247 INFO L225 Difference]: With dead ends: 582 [2023-12-15 21:38:37,247 INFO L226 Difference]: Without dead ends: 319 [2023-12-15 21:38:37,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:38:37,248 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:37,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 196 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:38:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-15 21:38:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 310. [2023-12-15 21:38:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 240 states have (on average 1.125) internal successors, (270), 243 states have internal predecessors, (270), 52 states have call successors, (52), 17 states have call predecessors, (52), 17 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 21:38:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2023-12-15 21:38:37,278 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 128 [2023-12-15 21:38:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:37,278 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2023-12-15 21:38:37,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2023-12-15 21:38:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-15 21:38:37,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:38:37,280 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:37,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:38:37,280 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:38:37,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:38:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2136478238, now seen corresponding path program 1 times [2023-12-15 21:38:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:38:37,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123858589] [2023-12-15 21:38:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:38:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:38:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:38:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:38:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:38:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:38:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:38:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:38:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:38:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:38:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:38:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:38:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:38:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:38:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:38:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:38:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:38:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:38:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:38:37,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:38:37,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123858589] [2023-12-15 21:38:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123858589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:38:37,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:38:37,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:38:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065131411] [2023-12-15 21:38:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:38:37,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:38:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:38:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:38:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:38:37,428 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:38:37,524 INFO L93 Difference]: Finished difference Result 557 states and 662 transitions. [2023-12-15 21:38:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:38:37,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-12-15 21:38:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:38:37,525 INFO L225 Difference]: With dead ends: 557 [2023-12-15 21:38:37,525 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:38:37,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:38:37,527 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:38:37,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 442 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:38:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:38:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:38:37,527 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) [2023-12-15 21:38:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:38:37,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-12-15 21:38:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:38:37,528 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:38:37,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:38:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:38:37,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:38:37,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:38:37,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:38:37,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:38:39,006 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 21:38:39,006 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 21:38:39,006 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 21:38:39,006 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 21:38:39,006 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse12 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (* 256 (div .cse16 256))) (.cse14 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse13 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse13 256) 0)) (.cse3 (<= (+ .cse15 .cse14) (+ .cse16 (* 256 (div .cse14 256))))) (.cse11 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse4 (<= .cse14 (+ .cse15 (* 256 (div (+ (* (- 1) .cse16) .cse14) 256)) 255))) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_5_Pointer~0.offset 0)) (.cse7 (= |~#var_1_5~0.offset| 0)) (.cse8 (= .cse13 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (mod (+ (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset) 240) 256)) (.cse10 (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (or (and (= .cse9 .cse10) (<= .cse9 127)) (and (<= 128 .cse9) (= .cse9 (+ 256 .cse10)))))) (and .cse0 .cse1 .cse2 .cse3 .cse11 (<= .cse12 (+ 255 (* 256 (div (+ (- 1) .cse12) 256)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-12-15 21:38:39,006 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-15 21:38:39,006 INFO L895 garLoopResultBuilder]: At program point L118-2(lines 118 124) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse12 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (* 256 (div .cse16 256))) (.cse14 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse13 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse13 256) 0)) (.cse3 (<= (+ .cse15 .cse14) (+ .cse16 (* 256 (div .cse14 256))))) (.cse11 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse4 (<= .cse14 (+ .cse15 (* 256 (div (+ (* (- 1) .cse16) .cse14) 256)) 255))) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_5_Pointer~0.offset 0)) (.cse7 (= |~#var_1_5~0.offset| 0)) (.cse8 (= .cse13 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (mod (+ (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset) 240) 256)) (.cse10 (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (or (and (= .cse9 .cse10) (<= .cse9 127)) (and (<= 128 .cse9) (= .cse9 (+ 256 .cse10)))))) (and .cse0 .cse1 .cse2 .cse3 .cse11 (<= .cse12 (+ 255 (* 256 (div (+ (- 1) .cse12) 256)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-12-15 21:38:39,006 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 21:38:39,006 INFO L899 garLoopResultBuilder]: For program point L118-3(lines 118 124) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse12 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)) (.cse15 (* 256 (div .cse16 256))) (.cse14 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse13 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse13 256) 0)) (.cse3 (<= (+ .cse15 .cse14) (+ .cse16 (* 256 (div .cse14 256))))) (.cse11 (not (= (select (select |#memory_int#3| ~var_1_4_Pointer~0.base) ~var_1_4_Pointer~0.offset) (select (select |#memory_int#9| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) (.cse4 (<= .cse14 (+ .cse15 (* 256 (div (+ (* (- 1) .cse16) .cse14) 256)) 255))) (.cse5 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse6 (= ~var_1_5_Pointer~0.offset 0)) (.cse7 (= |~#var_1_5~0.offset| 0)) (.cse8 (= .cse13 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (let ((.cse9 (mod (+ (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset) 240) 256)) (.cse10 (select (select |#memory_int#7| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (or (and (= .cse9 .cse10) (<= .cse9 127)) (and (<= 128 .cse9) (= .cse9 (+ 256 .cse10)))))) (and .cse0 .cse1 .cse2 .cse3 .cse11 (<= .cse12 (+ 255 (* 256 (div (+ (- 1) .cse12) 256)))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8))))) [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2023-12-15 21:38:39,007 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse11 (* 256 (div .cse12 256))) (.cse10 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse9 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse9 256) 0)) (.cse3 (<= (+ .cse11 .cse10) (+ .cse12 (* 256 (div .cse10 256))))) (.cse5 (<= .cse10 (+ .cse11 (* 256 (div (+ (* (- 1) .cse12) .cse10) 256)) 255))) (.cse6 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_5_Pointer~0.offset 0)) (.cse8 (= |~#var_1_5~0.offset| 0)) (.cse4 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 (+ 255 (* 256 (div (+ (- 1) .cse4) 256)))) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= .cse9 .cse4)))))) [2023-12-15 21:38:39,007 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (= (select (select |#memory_int#12| |~#var_1_13~0.base|) |~#var_1_13~0.offset|) |ULTIMATE.start_updateVariables_#t~mem59#1|) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)) [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse11 (* 256 (div .cse12 256))) (.cse10 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset)) (.cse9 (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0))) (let ((.cse0 (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|)) (.cse1 (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset)) (.cse2 (<= (mod .cse9 256) 0)) (.cse3 (<= (+ .cse11 .cse10) (+ .cse12 (* 256 (div .cse10 256))))) (.cse5 (<= .cse10 (+ .cse11 (* 256 (div (+ (* (- 1) .cse12) .cse10) 256)) 255))) (.cse6 (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base)) (.cse7 (= ~var_1_5_Pointer~0.offset 0)) (.cse8 (= |~#var_1_5~0.offset| 0)) (.cse4 (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 (+ 255 (* 256 (div (+ (- 1) .cse4) 256)))) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= .cse9 .cse4)))))) [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 66) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)) [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 81) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-12-15 21:38:39,008 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0)) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L62-2(lines 56 66) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L112-2(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L112-3(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,009 INFO L899 garLoopResultBuilder]: For program point L112-4(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-5(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-6(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-8(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-10(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-12(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-14(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-15(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-16(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-17(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-19(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-21(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-23(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-25(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-26(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-27(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,010 INFO L899 garLoopResultBuilder]: For program point L112-29(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-30(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-31(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-32(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-34(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-35(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-37(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-39(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-41(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L112-43(line 112) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 82) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,011 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-15 21:38:39,011 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select (select |#memory_int#12| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (and (= ~var_1_13_Pointer~0.base |~#var_1_13~0.base|) (= |~#var_1_13~0.offset| ~var_1_13_Pointer~0.offset) (<= (mod (select (select |#memory_int#4| ~var_1_5_Pointer~0.base) 0) 256) 0) (<= (+ .cse0 .cse1) (+ .cse2 (* 256 (div .cse1 256)))) (<= .cse1 (+ .cse0 (* 256 (div (+ (* (- 1) .cse2) .cse1) 256)) 255)) (= |~#var_1_5~0.base| ~var_1_5_Pointer~0.base) (= ~var_1_5_Pointer~0.offset 0) (= |~#var_1_5~0.offset| 0)))) [2023-12-15 21:38:39,012 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-15 21:38:39,012 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-12-15 21:38:39,012 INFO L899 garLoopResultBuilder]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2023-12-15 21:38:39,012 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2023-12-15 21:38:39,012 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2023-12-15 21:38:39,014 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:38:39,015 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:38:39,023 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-15 21:38:39,025 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,026 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,028 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated [2023-12-15 21:38:39,029 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-15 21:38:39,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:38:39 BoogieIcfgContainer [2023-12-15 21:38:39,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:38:39,030 INFO L158 Benchmark]: Toolchain (without parser) took 14157.16ms. Allocated memory was 220.2MB in the beginning and 497.0MB in the end (delta: 276.8MB). Free memory was 184.4MB in the beginning and 189.7MB in the end (delta: -5.3MB). Peak memory consumption was 294.0MB. Max. memory is 8.0GB. [2023-12-15 21:38:39,030 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:38:39,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.68ms. Allocated memory is still 220.2MB. Free memory was 183.9MB in the beginning and 170.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 21:38:39,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.10ms. Allocated memory is still 220.2MB. Free memory was 170.2MB in the beginning and 167.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:38:39,031 INFO L158 Benchmark]: Boogie Preprocessor took 69.89ms. Allocated memory is still 220.2MB. Free memory was 167.1MB in the beginning and 161.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:38:39,031 INFO L158 Benchmark]: RCFGBuilder took 538.99ms. Allocated memory is still 220.2MB. Free memory was 161.8MB in the beginning and 125.7MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-12-15 21:38:39,031 INFO L158 Benchmark]: TraceAbstraction took 13291.01ms. Allocated memory was 220.2MB in the beginning and 497.0MB in the end (delta: 276.8MB). Free memory was 125.1MB in the beginning and 189.7MB in the end (delta: -64.6MB). Peak memory consumption was 235.3MB. Max. memory is 8.0GB. [2023-12-15 21:38:39,032 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.11ms. Allocated memory is still 161.5MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.68ms. Allocated memory is still 220.2MB. Free memory was 183.9MB in the beginning and 170.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.10ms. Allocated memory is still 220.2MB. Free memory was 170.2MB in the beginning and 167.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.89ms. Allocated memory is still 220.2MB. Free memory was 167.1MB in the beginning and 161.8MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 538.99ms. Allocated memory is still 220.2MB. Free memory was 161.8MB in the beginning and 125.7MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13291.01ms. Allocated memory was 220.2MB in the beginning and 497.0MB in the end (delta: 276.8MB). Free memory was 125.1MB in the beginning and 189.7MB in the end (delta: -64.6MB). Peak memory consumption was 235.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_4_Pointer~0!base][~var_1_4_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_5_Pointer~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated * 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: 19]: 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 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2995 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2995 mSDsluCounter, 11254 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8085 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2075 IncrementalHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 3169 mSDtfsCounter, 2075 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1372 GetRequests, 1208 SyntacticMatches, 3 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=18, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 410 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 901 PreInvPairs, 953 NumberOfFragments, 2458 HoareAnnotationTreeSize, 901 FormulaSimplifications, 2437 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FormulaSimplificationsInter, 9922 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2945 NumberOfCodeBlocks, 2945 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3169 ConstructedInterpolants, 0 QuantifiedInterpolants, 13668 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1092 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 10588/10920 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: 118]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-15 21:38:39,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...