/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:53:52,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:53:53,013 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-21 01:53:53,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:53:53,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:53:53,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:53:53,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:53:53,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:53:53,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:53:53,032 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:53:53,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:53:53,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:53:53,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:53:53,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:53:53,033 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:53:53,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:53:53,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:53:53,034 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:53:53,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:53:53,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:53:53,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:53:53,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:53:53,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:53:53,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:53:53,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:53:53,035 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:53:53,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:53:53,036 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:53:53,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:53:53,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:53:53,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:53:53,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:53:53,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:53:53,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:53:53,038 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:53:53,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:53:53,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:53:53,038 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 -> false [2023-12-21 01:53:53,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:53:53,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:53:53,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:53:53,210 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:53:53,210 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:53:53,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2023-12-21 01:53:54,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:53:54,463 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:53:54,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-37.i [2023-12-21 01:53:54,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54df50430/2001c33c57a244d287603726741b3fd8/FLAG1a4480330 [2023-12-21 01:53:54,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54df50430/2001c33c57a244d287603726741b3fd8 [2023-12-21 01:53:54,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:53:54,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:53:54,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:53:54,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:53:54,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:53:54,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648544ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54, skipping insertion in model container [2023-12-21 01:53:54,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,509 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:53:54,597 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-ap_file-37.i[917,930] [2023-12-21 01:53:54,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:53:54,642 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:53:54,650 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-ap_file-37.i[917,930] [2023-12-21 01:53:54,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:53:54,708 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:53:54,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54 WrapperNode [2023-12-21 01:53:54,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:53:54,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:53:54,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:53:54,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:53:54,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,752 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2023-12-21 01:53:54,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:53:54,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:53:54,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:53:54,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:53:54,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,785 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2023-12-21 01:53:54,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:53:54,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:53:54,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:53:54,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:53:54,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (1/1) ... [2023-12-21 01:53:54,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:53:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:53:54,830 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-21 01:53:54,833 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-21 01:53:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:53:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:53:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:53:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:53:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:53:54,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:53:54,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:53:54,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:53:54,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-21 01:53:54,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:53:54,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:53:54,980 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:53:54,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:53:55,281 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:53:55,305 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:53:55,305 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:53:55,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:53:55 BoogieIcfgContainer [2023-12-21 01:53:55,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:53:55,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:53:55,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:53:55,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:53:55,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:53:54" (1/3) ... [2023-12-21 01:53:55,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4876e9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:53:55, skipping insertion in model container [2023-12-21 01:53:55,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:53:54" (2/3) ... [2023-12-21 01:53:55,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4876e9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:53:55, skipping insertion in model container [2023-12-21 01:53:55,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:53:55" (3/3) ... [2023-12-21 01:53:55,311 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-37.i [2023-12-21 01:53:55,322 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:53:55,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:53:55,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:53:55,364 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;@5ce8adff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:53:55,364 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:53:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 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-21 01:53:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:53:55,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:55,376 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-21 01:53:55,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:55,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash 466555047, now seen corresponding path program 1 times [2023-12-21 01:53:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:55,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651448168] [2023-12-21 01:53:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:53:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:53:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:53:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:53:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:53:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:53:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:53:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:53:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:53:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:53:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:53:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:53:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:53:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:53:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:53:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:55,716 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-21 01:53:55,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:55,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651448168] [2023-12-21 01:53:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651448168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:55,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:53:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204027953] [2023-12-21 01:53:55,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:55,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:53:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:55,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:53:55,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:53:55,740 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-21 01:53:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:55,769 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2023-12-21 01:53:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:53:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 117 [2023-12-21 01:53:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:55,776 INFO L225 Difference]: With dead ends: 177 [2023-12-21 01:53:55,776 INFO L226 Difference]: Without dead ends: 88 [2023-12-21 01:53:55,779 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-21 01:53:55,781 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-21 01:53:55,781 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-21 01:53:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-21 01:53:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-21 01:53:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 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-21 01:53:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2023-12-21 01:53:55,808 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 117 [2023-12-21 01:53:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:55,809 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2023-12-21 01:53:55,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-21 01:53:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2023-12-21 01:53:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:53:55,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:55,812 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-21 01:53:55,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:53:55,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:55,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1678433335, now seen corresponding path program 1 times [2023-12-21 01:53:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073648429] [2023-12-21 01:53:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:53:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:53:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:53:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:53:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:53:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:53:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:53:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:53:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:53:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:53:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:53:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:53:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:53:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:53:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:53:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,162 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-21 01:53:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073648429] [2023-12-21 01:53:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073648429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:53:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979523862] [2023-12-21 01:53:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:56,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:53:56,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:53:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:53:56,170 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:56,242 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2023-12-21 01:53:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:53:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:56,246 INFO L225 Difference]: With dead ends: 187 [2023-12-21 01:53:56,246 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 01:53:56,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:53:56,249 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 21 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:56,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 363 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:53:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 01:53:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2023-12-21 01:53:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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-21 01:53:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2023-12-21 01:53:56,264 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 117 [2023-12-21 01:53:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:56,265 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2023-12-21 01:53:56,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2023-12-21 01:53:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:53:56,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:56,267 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-21 01:53:56,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:53:56,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:56,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1807187335, now seen corresponding path program 1 times [2023-12-21 01:53:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738444752] [2023-12-21 01:53:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:53:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:53:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:53:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:53:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:53:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:53:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:53:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:53:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:53:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:53:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:53:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:53:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:53:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:53:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:53:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,507 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-21 01:53:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738444752] [2023-12-21 01:53:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738444752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:53:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929721519] [2023-12-21 01:53:56,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:56,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:53:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:56,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:53:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:53:56,512 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:56,555 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2023-12-21 01:53:56,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:53:56,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:56,562 INFO L225 Difference]: With dead ends: 187 [2023-12-21 01:53:56,562 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 01:53:56,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:53:56,566 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:56,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 361 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:53:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 01:53:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-12-21 01:53:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 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-21 01:53:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2023-12-21 01:53:56,572 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 117 [2023-12-21 01:53:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:56,572 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2023-12-21 01:53:56,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2023-12-21 01:53:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:53:56,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:56,576 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-21 01:53:56,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:53:56,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:56,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1864445637, now seen corresponding path program 1 times [2023-12-21 01:53:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938155706] [2023-12-21 01:53:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:53:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:53:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:53:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:53:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:53:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:53:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:53:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:53:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:53:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:53:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:53:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:53:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:53:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:53:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:53:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:56,711 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-21 01:53:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938155706] [2023-12-21 01:53:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938155706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:56,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:53:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486253312] [2023-12-21 01:53:56,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:56,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:53:56,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:53:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:53:56,714 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:56,743 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2023-12-21 01:53:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:53:56,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:56,744 INFO L225 Difference]: With dead ends: 187 [2023-12-21 01:53:56,744 INFO L226 Difference]: Without dead ends: 96 [2023-12-21 01:53:56,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:53:56,753 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:56,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 361 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:53:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-21 01:53:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-12-21 01:53:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 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-21 01:53:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2023-12-21 01:53:56,759 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 117 [2023-12-21 01:53:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:56,759 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2023-12-21 01:53:56,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-21 01:53:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2023-12-21 01:53:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:53:56,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:56,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, 1, 1] [2023-12-21 01:53:56,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:53:56,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:56,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1864505219, now seen corresponding path program 1 times [2023-12-21 01:53:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908128684] [2023-12-21 01:53:56,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:56,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:53:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:53:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:53:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:53:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:53:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:53:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:53:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:53:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:53:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:53:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:53:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:53:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:53:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:53:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:53:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:57,631 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-21 01:53:57,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908128684] [2023-12-21 01:53:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908128684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:53:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776255414] [2023-12-21 01:53:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:57,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:53:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:53:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:53:57,633 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 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-21 01:53:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:57,858 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2023-12-21 01:53:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:53:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 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 117 [2023-12-21 01:53:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:57,861 INFO L225 Difference]: With dead ends: 211 [2023-12-21 01:53:57,861 INFO L226 Difference]: Without dead ends: 118 [2023-12-21 01:53:57,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:53:57,862 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 311 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:57,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 515 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:53:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-21 01:53:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2023-12-21 01:53:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.315217391304348) internal successors, (121), 93 states have internal predecessors, (121), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 01:53:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2023-12-21 01:53:57,887 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 117 [2023-12-21 01:53:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:57,888 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2023-12-21 01:53:57,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 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-21 01:53:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2023-12-21 01:53:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:53:57,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:57,893 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] [2023-12-21 01:53:57,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:53:57,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:57,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1075417738, now seen corresponding path program 1 times [2023-12-21 01:53:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:57,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791573442] [2023-12-21 01:53:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:53:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:53:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:53:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:53:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:53:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:53:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:53:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:53:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:53:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:53:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:53:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:53:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:53:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:53:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:53:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:53:58,247 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-21 01:53:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:53:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791573442] [2023-12-21 01:53:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791573442] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:53:58,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:53:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:53:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056328385] [2023-12-21 01:53:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:53:58,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:53:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:53:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:53:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:53:58,249 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-21 01:53:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:53:58,486 INFO L93 Difference]: Finished difference Result 339 states and 473 transitions. [2023-12-21 01:53:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:53:58,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 120 [2023-12-21 01:53:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:53:58,490 INFO L225 Difference]: With dead ends: 339 [2023-12-21 01:53:58,490 INFO L226 Difference]: Without dead ends: 242 [2023-12-21 01:53:58,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:53:58,492 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 279 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:53:58,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 645 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:53:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-21 01:53:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 210. [2023-12-21 01:53:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.3154761904761905) internal successors, (221), 170 states have internal predecessors, (221), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 01:53:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 295 transitions. [2023-12-21 01:53:58,520 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 295 transitions. Word has length 120 [2023-12-21 01:53:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:53:58,520 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 295 transitions. [2023-12-21 01:53:58,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-21 01:53:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 295 transitions. [2023-12-21 01:53:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:53:58,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:53:58,523 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] [2023-12-21 01:53:58,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:53:58,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:53:58,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:53:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2086534988, now seen corresponding path program 1 times [2023-12-21 01:53:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:53:58,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159468953] [2023-12-21 01:53:58,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:53:58,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:53:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:00,891 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-21 01:54:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159468953] [2023-12-21 01:54:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159468953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:54:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943448943] [2023-12-21 01:54:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:00,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:54:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:54:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:54:00,894 INFO L87 Difference]: Start difference. First operand 210 states and 295 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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-21 01:54:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:01,846 INFO L93 Difference]: Finished difference Result 574 states and 800 transitions. [2023-12-21 01:54:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:54:01,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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 120 [2023-12-21 01:54:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:01,849 INFO L225 Difference]: With dead ends: 574 [2023-12-21 01:54:01,849 INFO L226 Difference]: Without dead ends: 384 [2023-12-21 01:54:01,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2023-12-21 01:54:01,851 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 579 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:01,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 595 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:54:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-21 01:54:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 334. [2023-12-21 01:54:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 288 states have (on average 1.3472222222222223) internal successors, (388), 292 states have internal predecessors, (388), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-21 01:54:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 466 transitions. [2023-12-21 01:54:01,891 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 466 transitions. Word has length 120 [2023-12-21 01:54:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:01,891 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 466 transitions. [2023-12-21 01:54:01,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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-21 01:54:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 466 transitions. [2023-12-21 01:54:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:54:01,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:01,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, 1, 1, 1] [2023-12-21 01:54:01,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:54:01,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:01,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1621626294, now seen corresponding path program 1 times [2023-12-21 01:54:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443094025] [2023-12-21 01:54:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:01,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:02,405 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-21 01:54:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443094025] [2023-12-21 01:54:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443094025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:54:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031749823] [2023-12-21 01:54:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:02,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:54:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:54:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:54:02,407 INFO L87 Difference]: Start difference. First operand 334 states and 466 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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-21 01:54:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:02,853 INFO L93 Difference]: Finished difference Result 753 states and 1042 transitions. [2023-12-21 01:54:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:54:02,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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 120 [2023-12-21 01:54:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:02,855 INFO L225 Difference]: With dead ends: 753 [2023-12-21 01:54:02,855 INFO L226 Difference]: Without dead ends: 439 [2023-12-21 01:54:02,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:54:02,856 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 396 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:02,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 868 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:54:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-12-21 01:54:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 357. [2023-12-21 01:54:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.3277591973244147) internal successors, (397), 303 states have internal predecessors, (397), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 45 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-21 01:54:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2023-12-21 01:54:02,896 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 120 [2023-12-21 01:54:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:02,897 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2023-12-21 01:54:02,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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-21 01:54:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2023-12-21 01:54:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:54:02,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:02,898 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] [2023-12-21 01:54:02,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:54:02,898 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:02,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 402993974, now seen corresponding path program 1 times [2023-12-21 01:54:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:02,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153749070] [2023-12-21 01:54:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:03,359 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-21 01:54:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153749070] [2023-12-21 01:54:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153749070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:03,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:54:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674270098] [2023-12-21 01:54:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:03,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:54:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:03,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:54:03,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:54:03,361 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-21 01:54:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:03,779 INFO L93 Difference]: Finished difference Result 758 states and 1042 transitions. [2023-12-21 01:54:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:54:03,780 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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 120 [2023-12-21 01:54:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:03,782 INFO L225 Difference]: With dead ends: 758 [2023-12-21 01:54:03,782 INFO L226 Difference]: Without dead ends: 421 [2023-12-21 01:54:03,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:54:03,784 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 328 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:03,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 847 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:54:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-21 01:54:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 343. [2023-12-21 01:54:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 293 states have (on average 1.3310580204778157) internal successors, (390), 297 states have internal predecessors, (390), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-21 01:54:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 472 transitions. [2023-12-21 01:54:03,833 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 472 transitions. Word has length 120 [2023-12-21 01:54:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:03,833 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 472 transitions. [2023-12-21 01:54:03,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-21 01:54:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 472 transitions. [2023-12-21 01:54:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:54:03,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:03,835 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] [2023-12-21 01:54:03,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:54:03,835 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:03,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -183812040, now seen corresponding path program 1 times [2023-12-21 01:54:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714068851] [2023-12-21 01:54:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:04,316 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-21 01:54:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:04,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714068851] [2023-12-21 01:54:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714068851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:04,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:54:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201749702] [2023-12-21 01:54:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:04,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:54:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:54:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:54:04,317 INFO L87 Difference]: Start difference. First operand 343 states and 472 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-21 01:54:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:04,631 INFO L93 Difference]: Finished difference Result 701 states and 956 transitions. [2023-12-21 01:54:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:54:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 120 [2023-12-21 01:54:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:04,633 INFO L225 Difference]: With dead ends: 701 [2023-12-21 01:54:04,633 INFO L226 Difference]: Without dead ends: 378 [2023-12-21 01:54:04,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:54:04,635 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 357 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:04,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 679 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:54:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-21 01:54:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 253. [2023-12-21 01:54:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 212 states have (on average 1.3254716981132075) internal successors, (281), 214 states have internal predecessors, (281), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 01:54:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 347 transitions. [2023-12-21 01:54:04,677 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 347 transitions. Word has length 120 [2023-12-21 01:54:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:04,678 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 347 transitions. [2023-12-21 01:54:04,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-21 01:54:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 347 transitions. [2023-12-21 01:54:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:54:04,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:04,679 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] [2023-12-21 01:54:04,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:54:04,679 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:04,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1802772362, now seen corresponding path program 1 times [2023-12-21 01:54:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729723487] [2023-12-21 01:54:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:05,249 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-21 01:54:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729723487] [2023-12-21 01:54:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729723487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:54:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104585257] [2023-12-21 01:54:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:05,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:54:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:54:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:54:05,251 INFO L87 Difference]: Start difference. First operand 253 states and 347 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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-21 01:54:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:05,854 INFO L93 Difference]: Finished difference Result 605 states and 821 transitions. [2023-12-21 01:54:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:54:05,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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 120 [2023-12-21 01:54:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:05,858 INFO L225 Difference]: With dead ends: 605 [2023-12-21 01:54:05,858 INFO L226 Difference]: Without dead ends: 371 [2023-12-21 01:54:05,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:54:05,859 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 374 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:05,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 928 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:54:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-21 01:54:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 251. [2023-12-21 01:54:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 210 states have (on average 1.319047619047619) internal successors, (277), 212 states have internal predecessors, (277), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 01:54:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 343 transitions. [2023-12-21 01:54:05,905 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 343 transitions. Word has length 120 [2023-12-21 01:54:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:05,909 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 343 transitions. [2023-12-21 01:54:05,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 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-21 01:54:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2023-12-21 01:54:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 01:54:05,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:05,910 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] [2023-12-21 01:54:05,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:54:05,911 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:05,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1273562614, now seen corresponding path program 1 times [2023-12-21 01:54:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127782266] [2023-12-21 01:54:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:05,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:06,408 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-21 01:54:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127782266] [2023-12-21 01:54:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127782266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:54:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:54:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:54:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874337947] [2023-12-21 01:54:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:54:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:54:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:54:06,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:54:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:54:06,410 INFO L87 Difference]: Start difference. First operand 251 states and 343 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-21 01:54:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:54:06,775 INFO L93 Difference]: Finished difference Result 547 states and 740 transitions. [2023-12-21 01:54:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:54:06,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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 120 [2023-12-21 01:54:06,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:54:06,779 INFO L225 Difference]: With dead ends: 547 [2023-12-21 01:54:06,779 INFO L226 Difference]: Without dead ends: 316 [2023-12-21 01:54:06,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:54:06,780 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 257 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:54:06,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 871 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:54:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-12-21 01:54:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 245. [2023-12-21 01:54:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 204 states have (on average 1.3186274509803921) internal successors, (269), 206 states have internal predecessors, (269), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 01:54:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 335 transitions. [2023-12-21 01:54:06,813 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 335 transitions. Word has length 120 [2023-12-21 01:54:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:54:06,814 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 335 transitions. [2023-12-21 01:54:06,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-21 01:54:06,814 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 335 transitions. [2023-12-21 01:54:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 01:54:06,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:54:06,815 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] [2023-12-21 01:54:06,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:54:06,815 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:54:06,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:54:06,815 INFO L85 PathProgramCache]: Analyzing trace with hash -35020257, now seen corresponding path program 1 times [2023-12-21 01:54:06,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:54:06,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596776971] [2023-12-21 01:54:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:06,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:54:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 01:54:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-21 01:54:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:54:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:54:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:54:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:54:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:54:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:54:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:54:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:54:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:54:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:54:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:54:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:54:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:54:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 01:54:08,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:54:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596776971] [2023-12-21 01:54:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596776971] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:54:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449585809] [2023-12-21 01:54:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:54:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:54:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:54:08,167 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-21 01:54:08,170 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-21 01:54:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:54:08,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-21 01:54:08,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:54:09,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 64 treesize of output 51 [2023-12-21 01:54:09,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-12-21 01:54:09,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-12-21 01:54:09,467 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2023-12-21 01:54:09,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 169 treesize of output 159 [2023-12-21 01:54:09,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:11,472 INFO L349 Elim1Store]: treesize reduction 2040, result has 12.7 percent of original size [2023-12-21 01:54:11,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 100 case distinctions, treesize of input 435 treesize of output 939 [2023-12-21 01:54:14,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:14,663 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:14,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:14,906 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:14,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:15,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:15,266 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:15,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:15,570 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:15,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:15,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:15,909 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:15,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:16,226 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:16,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:16,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:16,598 INFO L349 Elim1Store]: treesize reduction 104, result has 14.8 percent of original size [2023-12-21 01:54:16,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 143 [2023-12-21 01:54:23,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:23,357 INFO L349 Elim1Store]: treesize reduction 688, result has 9.1 percent of original size [2023-12-21 01:54:23,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 34 case distinctions, treesize of input 409 treesize of output 561 [2023-12-21 01:54:24,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:24,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2023-12-21 01:54:24,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:24,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2023-12-21 01:54:25,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:25,422 INFO L349 Elim1Store]: treesize reduction 128, result has 35.0 percent of original size [2023-12-21 01:54:25,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 250 treesize of output 294 [2023-12-21 01:54:26,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:26,539 INFO L349 Elim1Store]: treesize reduction 1080, result has 8.7 percent of original size [2023-12-21 01:54:26,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 459 treesize of output 641 [2023-12-21 01:54:29,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:29,339 INFO L349 Elim1Store]: treesize reduction 240, result has 30.0 percent of original size [2023-12-21 01:54:29,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 284 treesize of output 358 [2023-12-21 01:54:29,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:30,422 INFO L349 Elim1Store]: treesize reduction 1080, result has 8.7 percent of original size [2023-12-21 01:54:30,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 57 case distinctions, treesize of input 562 treesize of output 740 [2023-12-21 01:54:36,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:37,024 INFO L349 Elim1Store]: treesize reduction 880, result has 8.9 percent of original size [2023-12-21 01:54:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 450 treesize of output 617 [2023-12-21 01:54:39,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:39,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-12-21 01:54:39,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:39,311 INFO L349 Elim1Store]: treesize reduction 41, result has 30.5 percent of original size [2023-12-21 01:54:39,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 90 [2023-12-21 01:54:39,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:39,448 INFO L349 Elim1Store]: treesize reduction 41, result has 30.5 percent of original size [2023-12-21 01:54:39,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 58 [2023-12-21 01:54:39,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:39,782 INFO L349 Elim1Store]: treesize reduction 90, result has 28.0 percent of original size [2023-12-21 01:54:39,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 110 [2023-12-21 01:54:41,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:54:42,138 INFO L349 Elim1Store]: treesize reduction 880, result has 8.9 percent of original size [2023-12-21 01:54:42,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 537 treesize of output 700 [2023-12-21 01:54:47,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 01:55:10,069 WARN L293 SmtUtils]: Spent 22.67s on a formula simplification. DAG size of input: 1537 DAG size of output: 62 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-21 01:55:10,070 INFO L349 Elim1Store]: treesize reduction 6450, result has 1.6 percent of original size [2023-12-21 01:55:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 32 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 40 new quantified variables, introduced 219 case distinctions, treesize of input 2873 treesize of output 6861 Received shutdown request... [2023-12-21 02:08:21,756 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 02:08:21,756 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 02:08:21,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:08:21,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 02:08:21,984 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,SelfDestructingSolverStorable12 [2023-12-21 02:08:21,984 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 123 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-479-5-4-5-2-3-2-3-1 context. [2023-12-21 02:08:21,992 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:08:21,999 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:08:22,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:08:22 BoogieIcfgContainer [2023-12-21 02:08:22,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:08:22,003 INFO L158 Benchmark]: Toolchain (without parser) took 867519.23ms. Allocated memory was 338.7MB in the beginning and 954.2MB in the end (delta: 615.5MB). Free memory was 296.7MB in the beginning and 753.3MB in the end (delta: -456.6MB). Peak memory consumption was 595.9MB. Max. memory is 8.0GB. [2023-12-21 02:08:22,005 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 235.9MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:08:22,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.68ms. Allocated memory is still 338.7MB. Free memory was 296.7MB in the beginning and 281.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:08:22,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.55ms. Allocated memory is still 338.7MB. Free memory was 281.7MB in the beginning and 278.2MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:08:22,006 INFO L158 Benchmark]: Boogie Preprocessor took 53.25ms. Allocated memory is still 338.7MB. Free memory was 278.2MB in the beginning and 273.6MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:08:22,006 INFO L158 Benchmark]: RCFGBuilder took 498.98ms. Allocated memory is still 338.7MB. Free memory was 273.3MB in the beginning and 294.2MB in the end (delta: -21.0MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2023-12-21 02:08:22,006 INFO L158 Benchmark]: TraceAbstraction took 866695.57ms. Allocated memory was 338.7MB in the beginning and 954.2MB in the end (delta: 615.5MB). Free memory was 293.7MB in the beginning and 753.3MB in the end (delta: -459.5MB). Peak memory consumption was 592.5MB. Max. memory is 8.0GB. [2023-12-21 02:08:22,012 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.44ms. Allocated memory is still 235.9MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.68ms. Allocated memory is still 338.7MB. Free memory was 296.7MB in the beginning and 281.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.55ms. Allocated memory is still 338.7MB. Free memory was 281.7MB in the beginning and 278.2MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.25ms. Allocated memory is still 338.7MB. Free memory was 278.2MB in the beginning and 273.6MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 498.98ms. Allocated memory is still 338.7MB. Free memory was 273.3MB in the beginning and 294.2MB in the end (delta: -21.0MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. * TraceAbstraction took 866695.57ms. Allocated memory was 338.7MB in the beginning and 954.2MB in the end (delta: 615.5MB). Free memory was 293.7MB in the beginning and 753.3MB in the end (delta: -459.5MB). Peak memory consumption was 592.5MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 123 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-479-5-4-5-2-3-2-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 866.6s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2917 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2917 mSDsluCounter, 7157 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5436 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3056 IncrementalHoareTripleChecker+Invalid, 3191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 1721 mSDtfsCounter, 3056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=8, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 577 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 9043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5040/5040 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown