/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-a_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:48:29,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:48:29,731 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:48:29,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:48:29,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:48:29,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:48:29,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:48:29,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:48:29,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:48:29,760 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:48:29,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:48:29,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:48:29,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:48:29,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:48:29,763 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:48:29,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:48:29,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:48:29,763 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:48:29,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:48:29,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:48:29,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:48:29,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:48:29,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:48:29,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:48:29,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:48:29,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:48:29,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:48:29,765 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:48:29,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:48:29,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:48:29,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:48:29,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:48:29,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:48:29,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:48:29,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:48:29,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:48:29,768 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:48:29,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:48:29,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:48:29,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:48:29,976 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:48:29,976 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:48:29,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2023-12-21 01:48:31,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:48:31,153 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:48:31,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2023-12-21 01:48:31,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fe3601a/3c25b30a21a840348a0b398f7f709b2e/FLAGb0294121e [2023-12-21 01:48:31,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58fe3601a/3c25b30a21a840348a0b398f7f709b2e [2023-12-21 01:48:31,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:48:31,566 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:48:31,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:48:31,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:48:31,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:48:31,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a8b31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31, skipping insertion in model container [2023-12-21 01:48:31,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:48:31,697 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-a_file-70.i[916,929] [2023-12-21 01:48:31,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:48:31,752 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:48:31,763 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-a_file-70.i[916,929] [2023-12-21 01:48:31,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:48:31,829 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:48:31,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31 WrapperNode [2023-12-21 01:48:31,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:48:31,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:48:31,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:48:31,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:48:31,835 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:48:31" (1/1) ... [2023-12-21 01:48:31,859 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:48:31" (1/1) ... [2023-12-21 01:48:31,889 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2023-12-21 01:48:31,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:48:31,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:48:31,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:48:31,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:48:31,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,931 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2023-12-21 01:48:31,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:48:31,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:48:31,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:48:31,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:48:31,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (1/1) ... [2023-12-21 01:48:31,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:48:31,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:48:31,992 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:48:32,043 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:48:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:48:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:48:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:48:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:48:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:48:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:48:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:48:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:48:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:48:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:48:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:48:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:48:32,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:48:32,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-21 01:48:32,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:48:32,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:48:32,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:48:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:48:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:48:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:48:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:48:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-21 01:48:32,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:48:32,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:48:32,187 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:48:32,189 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:48:32,466 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:48:32,489 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:48:32,489 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:48:32,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:48:32 BoogieIcfgContainer [2023-12-21 01:48:32,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:48:32,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:48:32,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:48:32,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:48:32,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:48:31" (1/3) ... [2023-12-21 01:48:32,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e71c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:48:32, skipping insertion in model container [2023-12-21 01:48:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:48:31" (2/3) ... [2023-12-21 01:48:32,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e71c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:48:32, skipping insertion in model container [2023-12-21 01:48:32,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:48:32" (3/3) ... [2023-12-21 01:48:32,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2023-12-21 01:48:32,530 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:48:32,531 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:48:32,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:48:32,578 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;@66cd9b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:48:32,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:48:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:48:32,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:32,589 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:32,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:32,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1419484856, now seen corresponding path program 1 times [2023-12-21 01:48:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527012833] [2023-12-21 01:48:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527012833] [2023-12-21 01:48:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527012833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:48:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845882825] [2023-12-21 01:48:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:32,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:48:32,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:48:32,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:48:32,846 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:32,872 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2023-12-21 01:48:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:48:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 01:48:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:32,878 INFO L225 Difference]: With dead ends: 185 [2023-12-21 01:48:32,878 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 01:48:32,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:48:32,882 INFO L413 NwaCegarLoop]: 132 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, 132 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:48:32,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 01:48:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-21 01:48:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 78 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2023-12-21 01:48:32,908 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 110 [2023-12-21 01:48:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:32,908 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2023-12-21 01:48:32,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2023-12-21 01:48:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:48:32,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:32,910 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:32,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:48:32,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:32,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1585516216, now seen corresponding path program 1 times [2023-12-21 01:48:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:32,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042391847] [2023-12-21 01:48:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042391847] [2023-12-21 01:48:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042391847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972977387] [2023-12-21 01:48:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:33,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:33,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:33,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:33,071 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:33,114 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2023-12-21 01:48:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 01:48:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:33,116 INFO L225 Difference]: With dead ends: 189 [2023-12-21 01:48:33,116 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 01:48:33,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:48:33,118 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 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:48:33,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 01:48:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-21 01:48:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-21 01:48:33,147 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 110 [2023-12-21 01:48:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:33,148 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-21 01:48:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-21 01:48:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 01:48:33,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:33,149 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:48:33,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:33,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1652719878, now seen corresponding path program 1 times [2023-12-21 01:48:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:33,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866793005] [2023-12-21 01:48:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866793005] [2023-12-21 01:48:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866793005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126810051] [2023-12-21 01:48:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:33,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:33,432 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:33,500 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2023-12-21 01:48:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:33,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 01:48:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:33,507 INFO L225 Difference]: With dead ends: 208 [2023-12-21 01:48:33,507 INFO L226 Difference]: Without dead ends: 115 [2023-12-21 01:48:33,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:48:33,509 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 39 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:33,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 425 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-21 01:48:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2023-12-21 01:48:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-12-21 01:48:33,516 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 110 [2023-12-21 01:48:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:33,516 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-12-21 01:48:33,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-12-21 01:48:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 01:48:33,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:33,518 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:48:33,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:33,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash -409704577, now seen corresponding path program 1 times [2023-12-21 01:48:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:33,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211311780] [2023-12-21 01:48:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:33,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211311780] [2023-12-21 01:48:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211311780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164856811] [2023-12-21 01:48:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:33,670 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:33,705 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2023-12-21 01:48:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:33,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 01:48:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:33,709 INFO L225 Difference]: With dead ends: 199 [2023-12-21 01:48:33,709 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 01:48:33,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:48:33,719 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 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:48:33,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 01:48:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-21 01:48:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-12-21 01:48:33,725 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 112 [2023-12-21 01:48:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:33,725 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-12-21 01:48:33,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-12-21 01:48:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 01:48:33,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:33,727 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:48:33,727 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:33,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash -352446275, now seen corresponding path program 1 times [2023-12-21 01:48:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738915535] [2023-12-21 01:48:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738915535] [2023-12-21 01:48:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738915535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:33,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:33,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:48:33,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293615127] [2023-12-21 01:48:33,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:33,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:48:33,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:48:33,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:48:33,846 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:33,872 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-21 01:48:33,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:48:33,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 01:48:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:33,875 INFO L225 Difference]: With dead ends: 199 [2023-12-21 01:48:33,875 INFO L226 Difference]: Without dead ends: 102 [2023-12-21 01:48:33,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:48:33,878 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 385 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:48:33,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 385 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-21 01:48:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-21 01:48:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2023-12-21 01:48:33,890 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 112 [2023-12-21 01:48:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:33,891 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2023-12-21 01:48:33,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2023-12-21 01:48:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 01:48:33,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:33,892 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:48:33,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:33,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash -352386693, now seen corresponding path program 1 times [2023-12-21 01:48:33,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:33,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619958721] [2023-12-21 01:48:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619958721] [2023-12-21 01:48:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619958721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:34,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:34,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:48:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351035625] [2023-12-21 01:48:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:34,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:48:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:48:34,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:48:34,297 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:34,350 INFO L93 Difference]: Finished difference Result 246 states and 354 transitions. [2023-12-21 01:48:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:48:34,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2023-12-21 01:48:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:34,351 INFO L225 Difference]: With dead ends: 246 [2023-12-21 01:48:34,351 INFO L226 Difference]: Without dead ends: 147 [2023-12-21 01:48:34,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:48:34,353 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 113 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:34,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 493 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-21 01:48:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 103. [2023-12-21 01:48:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2023-12-21 01:48:34,375 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 112 [2023-12-21 01:48:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:34,375 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2023-12-21 01:48:34,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2023-12-21 01:48:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 01:48:34,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:34,379 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:48:34,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:34,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2003128763, now seen corresponding path program 1 times [2023-12-21 01:48:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:34,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684301259] [2023-12-21 01:48:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:34,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684301259] [2023-12-21 01:48:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684301259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:34,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 01:48:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340802550] [2023-12-21 01:48:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:34,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 01:48:34,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:34,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 01:48:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 01:48:34,528 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:34,563 INFO L93 Difference]: Finished difference Result 205 states and 293 transitions. [2023-12-21 01:48:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 01:48:34,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 01:48:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:34,565 INFO L225 Difference]: With dead ends: 205 [2023-12-21 01:48:34,565 INFO L226 Difference]: Without dead ends: 103 [2023-12-21 01:48:34,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 01:48:34,567 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:34,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-21 01:48:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-21 01:48:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2023-12-21 01:48:34,576 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 112 [2023-12-21 01:48:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:34,578 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2023-12-21 01:48:34,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2023-12-21 01:48:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 01:48:34,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:34,580 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:48:34,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:34,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash 8984057, now seen corresponding path program 1 times [2023-12-21 01:48:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:34,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925571369] [2023-12-21 01:48:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:34,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925571369] [2023-12-21 01:48:34,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925571369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:34,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:34,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:48:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288561390] [2023-12-21 01:48:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:34,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:48:34,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:48:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:48:34,924 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:34,979 INFO L93 Difference]: Finished difference Result 268 states and 378 transitions. [2023-12-21 01:48:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:48:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2023-12-21 01:48:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:34,980 INFO L225 Difference]: With dead ends: 268 [2023-12-21 01:48:34,980 INFO L226 Difference]: Without dead ends: 166 [2023-12-21 01:48:34,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:48:34,981 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 103 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:34,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 663 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-21 01:48:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 113. [2023-12-21 01:48:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2023-12-21 01:48:34,986 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 112 [2023-12-21 01:48:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:34,986 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2023-12-21 01:48:34,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2023-12-21 01:48:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:48:34,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:34,988 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:48:34,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:34,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1151963246, now seen corresponding path program 1 times [2023-12-21 01:48:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327124877] [2023-12-21 01:48:34,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:34,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:35,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327124877] [2023-12-21 01:48:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327124877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:48:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687512720] [2023-12-21 01:48:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:35,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:48:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:35,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:48:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:48:35,260 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:35,304 INFO L93 Difference]: Finished difference Result 277 states and 388 transitions. [2023-12-21 01:48:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:48:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-21 01:48:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:35,305 INFO L225 Difference]: With dead ends: 277 [2023-12-21 01:48:35,305 INFO L226 Difference]: Without dead ends: 165 [2023-12-21 01:48:35,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:48:35,306 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 124 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:35,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 513 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-21 01:48:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 117. [2023-12-21 01:48:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2023-12-21 01:48:35,309 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 113 [2023-12-21 01:48:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:35,309 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2023-12-21 01:48:35,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2023-12-21 01:48:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 01:48:35,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:35,310 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:48:35,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:35,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1545080786, now seen corresponding path program 1 times [2023-12-21 01:48:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756201306] [2023-12-21 01:48:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756201306] [2023-12-21 01:48:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756201306] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:35,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:35,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:48:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798830949] [2023-12-21 01:48:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:35,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:48:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:48:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:48:35,448 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:35,482 INFO L93 Difference]: Finished difference Result 254 states and 354 transitions. [2023-12-21 01:48:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:48:35,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 01:48:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:35,483 INFO L225 Difference]: With dead ends: 254 [2023-12-21 01:48:35,483 INFO L226 Difference]: Without dead ends: 138 [2023-12-21 01:48:35,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:48:35,484 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:35,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 516 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:48:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-21 01:48:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2023-12-21 01:48:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2023-12-21 01:48:35,487 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 113 [2023-12-21 01:48:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:35,487 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2023-12-21 01:48:35,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:48:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2023-12-21 01:48:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:48:35,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:35,488 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:48:35,488 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:35,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1388961982, now seen corresponding path program 1 times [2023-12-21 01:48:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464082016] [2023-12-21 01:48:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464082016] [2023-12-21 01:48:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464082016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:48:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867847800] [2023-12-21 01:48:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:36,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:48:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:48:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:48:36,618 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:37,483 INFO L93 Difference]: Finished difference Result 425 states and 589 transitions. [2023-12-21 01:48:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 01:48:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-21 01:48:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:37,485 INFO L225 Difference]: With dead ends: 425 [2023-12-21 01:48:37,485 INFO L226 Difference]: Without dead ends: 306 [2023-12-21 01:48:37,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-12-21 01:48:37,487 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 283 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:37,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1823 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:48:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-12-21 01:48:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 136. [2023-12-21 01:48:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 01:48:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-12-21 01:48:37,495 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 114 [2023-12-21 01:48:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:37,495 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-12-21 01:48:37,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-12-21 01:48:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:48:37,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:37,497 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:48:37,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:37,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash 109098304, now seen corresponding path program 1 times [2023-12-21 01:48:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:37,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604967284] [2023-12-21 01:48:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:37,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604967284] [2023-12-21 01:48:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604967284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:48:37,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486019355] [2023-12-21 01:48:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:37,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:48:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:48:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:48:37,848 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:38,017 INFO L93 Difference]: Finished difference Result 380 states and 527 transitions. [2023-12-21 01:48:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:48:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-21 01:48:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:38,019 INFO L225 Difference]: With dead ends: 380 [2023-12-21 01:48:38,019 INFO L226 Difference]: Without dead ends: 245 [2023-12-21 01:48:38,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:48:38,020 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 144 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:38,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 880 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:48:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-21 01:48:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2023-12-21 01:48:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 188 states have (on average 1.3457446808510638) internal successors, (253), 189 states have internal predecessors, (253), 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:48:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 297 transitions. [2023-12-21 01:48:38,031 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 297 transitions. Word has length 114 [2023-12-21 01:48:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:38,031 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 297 transitions. [2023-12-21 01:48:38,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 297 transitions. [2023-12-21 01:48:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:48:38,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:38,033 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:48:38,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:38,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -982777280, now seen corresponding path program 1 times [2023-12-21 01:48:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895559737] [2023-12-21 01:48:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:38,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895559737] [2023-12-21 01:48:38,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895559737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:38,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:38,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:48:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415702190] [2023-12-21 01:48:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:38,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:48:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:38,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:48:38,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:48:38,403 INFO L87 Difference]: Start difference. First operand 213 states and 297 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:38,571 INFO L93 Difference]: Finished difference Result 525 states and 731 transitions. [2023-12-21 01:48:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:48:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-21 01:48:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:38,574 INFO L225 Difference]: With dead ends: 525 [2023-12-21 01:48:38,574 INFO L226 Difference]: Without dead ends: 313 [2023-12-21 01:48:38,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:48:38,575 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 171 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:38,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 665 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:48:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-21 01:48:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 206. [2023-12-21 01:48:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 182 states have internal predecessors, (242), 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:48:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 286 transitions. [2023-12-21 01:48:38,588 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 286 transitions. Word has length 114 [2023-12-21 01:48:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:38,588 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 286 transitions. [2023-12-21 01:48:38,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:48:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 286 transitions. [2023-12-21 01:48:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:48:38,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:38,590 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:48:38,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:38,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2032326338, now seen corresponding path program 1 times [2023-12-21 01:48:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767567405] [2023-12-21 01:48:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767567405] [2023-12-21 01:48:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767567405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:39,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:48:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233162425] [2023-12-21 01:48:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:39,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:48:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:48:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:48:39,564 INFO L87 Difference]: Start difference. First operand 206 states and 286 transitions. Second operand has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-21 01:48:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:48:40,035 INFO L93 Difference]: Finished difference Result 491 states and 682 transitions. [2023-12-21 01:48:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:48:40,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 114 [2023-12-21 01:48:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:48:40,038 INFO L225 Difference]: With dead ends: 491 [2023-12-21 01:48:40,038 INFO L226 Difference]: Without dead ends: 286 [2023-12-21 01:48:40,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:48:40,040 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 119 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:48:40,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1264 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:48:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-21 01:48:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 205. [2023-12-21 01:48:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.3333333333333333) internal successors, (240), 181 states have internal predecessors, (240), 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:48:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 284 transitions. [2023-12-21 01:48:40,058 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 284 transitions. Word has length 114 [2023-12-21 01:48:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:48:40,061 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 284 transitions. [2023-12-21 01:48:40,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 9.5) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-21 01:48:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 284 transitions. [2023-12-21 01:48:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 01:48:40,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:48:40,062 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:40,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:48:40,062 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:48:40,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:48:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 226888004, now seen corresponding path program 1 times [2023-12-21 01:48:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:48:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345712655] [2023-12-21 01:48:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:48:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:48:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:48:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:48:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:48:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:48:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:48:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:48:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:48:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:48:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:48:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:48:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:48:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:48:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:48:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:48:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:48:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345712655] [2023-12-21 01:48:41,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345712655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:48:41,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:48:41,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:48:41,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53298281] [2023-12-21 01:48:41,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:48:41,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:48:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:48:41,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:48:41,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:48:41,529 INFO L87 Difference]: Start difference. First operand 205 states and 284 transitions. Second operand has 12 states, 9 states have (on average 6.333333333333333) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-21 01:48:46,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:48:48,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:49:04,211 WARN L293 SmtUtils]: Spent 10.69s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 01:49:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:08,363 INFO L93 Difference]: Finished difference Result 545 states and 754 transitions. [2023-12-21 01:49:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 01:49:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.333333333333333) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 114 [2023-12-21 01:49:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:08,366 INFO L225 Difference]: With dead ends: 545 [2023-12-21 01:49:08,366 INFO L226 Difference]: Without dead ends: 341 [2023-12-21 01:49:08,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-21 01:49:08,367 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 212 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:08,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1972 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 853 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2023-12-21 01:49:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-12-21 01:49:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 202. [2023-12-21 01:49:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 178 states have internal predecessors, (236), 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:49:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 280 transitions. [2023-12-21 01:49:08,385 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 280 transitions. Word has length 114 [2023-12-21 01:49:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:08,385 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 280 transitions. [2023-12-21 01:49:08,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.333333333333333) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-21 01:49:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 280 transitions. [2023-12-21 01:49:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 01:49:08,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:08,386 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:08,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:49:08,387 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:08,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1322320531, now seen corresponding path program 1 times [2023-12-21 01:49:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187172003] [2023-12-21 01:49:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:49:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187172003] [2023-12-21 01:49:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187172003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648159579] [2023-12-21 01:49:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:08,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:08,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:08,589 INFO L87 Difference]: Start difference. First operand 202 states and 280 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:49:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:08,697 INFO L93 Difference]: Finished difference Result 622 states and 863 transitions. [2023-12-21 01:49:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:49:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-21 01:49:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:08,699 INFO L225 Difference]: With dead ends: 622 [2023-12-21 01:49:08,699 INFO L226 Difference]: Without dead ends: 421 [2023-12-21 01:49:08,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:49:08,700 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 185 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:08,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1057 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-21 01:49:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 398. [2023-12-21 01:49:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.335243553008596) internal successors, (466), 351 states have internal predecessors, (466), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-21 01:49:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 554 transitions. [2023-12-21 01:49:08,740 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 554 transitions. Word has length 115 [2023-12-21 01:49:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:08,742 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 554 transitions. [2023-12-21 01:49:08,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 01:49:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 554 transitions. [2023-12-21 01:49:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 01:49:08,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:08,743 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:49:08,743 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:08,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1456334037, now seen corresponding path program 1 times [2023-12-21 01:49:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493240069] [2023-12-21 01:49:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:49:08,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493240069] [2023-12-21 01:49:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493240069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:08,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:08,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:08,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881479528] [2023-12-21 01:49:08,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:08,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:08,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:08,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:08,944 INFO L87 Difference]: Start difference. First operand 398 states and 554 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:49:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:09,017 INFO L93 Difference]: Finished difference Result 798 states and 1109 transitions. [2023-12-21 01:49:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:49:09,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-21 01:49:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:09,019 INFO L225 Difference]: With dead ends: 798 [2023-12-21 01:49:09,019 INFO L226 Difference]: Without dead ends: 401 [2023-12-21 01:49:09,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:49:09,020 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 82 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:09,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 739 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-12-21 01:49:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2023-12-21 01:49:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.32378223495702) internal successors, (462), 351 states have internal predecessors, (462), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-21 01:49:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 550 transitions. [2023-12-21 01:49:09,055 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 550 transitions. Word has length 115 [2023-12-21 01:49:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:09,055 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 550 transitions. [2023-12-21 01:49:09,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:49:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 550 transitions. [2023-12-21 01:49:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 01:49:09,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:09,057 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:09,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:49:09,057 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:09,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash -630763509, now seen corresponding path program 1 times [2023-12-21 01:49:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630015978] [2023-12-21 01:49:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:49:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630015978] [2023-12-21 01:49:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630015978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:49:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622337257] [2023-12-21 01:49:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:09,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:49:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:49:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:49:09,669 INFO L87 Difference]: Start difference. First operand 398 states and 550 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 01:49:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:10,079 INFO L93 Difference]: Finished difference Result 1029 states and 1421 transitions. [2023-12-21 01:49:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 01:49:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-21 01:49:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:10,082 INFO L225 Difference]: With dead ends: 1029 [2023-12-21 01:49:10,082 INFO L226 Difference]: Without dead ends: 632 [2023-12-21 01:49:10,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:49:10,083 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 221 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:10,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1253 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:49:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-12-21 01:49:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 569. [2023-12-21 01:49:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 496 states have (on average 1.3165322580645162) internal successors, (653), 499 states have internal predecessors, (653), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-21 01:49:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 785 transitions. [2023-12-21 01:49:10,139 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 785 transitions. Word has length 116 [2023-12-21 01:49:10,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:10,140 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 785 transitions. [2023-12-21 01:49:10,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 01:49:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 785 transitions. [2023-12-21 01:49:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:49:10,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:10,141 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:49:10,141 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:10,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1956666822, now seen corresponding path program 1 times [2023-12-21 01:49:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:10,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818688318] [2023-12-21 01:49:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:10,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:49:10,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:10,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818688318] [2023-12-21 01:49:10,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818688318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:10,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:10,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:49:10,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633471431] [2023-12-21 01:49:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:10,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:49:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:49:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:49:10,697 INFO L87 Difference]: Start difference. First operand 569 states and 785 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:49:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:11,132 INFO L93 Difference]: Finished difference Result 1355 states and 1871 transitions. [2023-12-21 01:49:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:49:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 01:49:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:11,136 INFO L225 Difference]: With dead ends: 1355 [2023-12-21 01:49:11,136 INFO L226 Difference]: Without dead ends: 958 [2023-12-21 01:49:11,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:49:11,137 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 526 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:11,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1030 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 01:49:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-21 01:49:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 619. [2023-12-21 01:49:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 546 states have (on average 1.3131868131868132) internal successors, (717), 549 states have internal predecessors, (717), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-21 01:49:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 849 transitions. [2023-12-21 01:49:11,186 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 849 transitions. Word has length 117 [2023-12-21 01:49:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:11,186 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 849 transitions. [2023-12-21 01:49:11,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:49:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 849 transitions. [2023-12-21 01:49:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 01:49:11,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:11,187 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 01:49:11,187 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:11,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash -415072440, now seen corresponding path program 1 times [2023-12-21 01:49:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235924682] [2023-12-21 01:49:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:49:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:49:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:49:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:49:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:49:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:49:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:49:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:49:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 01:49:11,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235924682] [2023-12-21 01:49:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235924682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675859138] [2023-12-21 01:49:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:11,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:11,419 INFO L87 Difference]: Start difference. First operand 619 states and 849 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:49:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:11,503 INFO L93 Difference]: Finished difference Result 1026 states and 1409 transitions. [2023-12-21 01:49:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:49:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 01:49:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:11,505 INFO L225 Difference]: With dead ends: 1026 [2023-12-21 01:49:11,505 INFO L226 Difference]: Without dead ends: 579 [2023-12-21 01:49:11,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:49:11,508 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 54 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:11,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 759 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-21 01:49:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 383. [2023-12-21 01:49:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 334 states have (on average 1.3053892215568863) internal successors, (436), 336 states have internal predecessors, (436), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-21 01:49:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 524 transitions. [2023-12-21 01:49:11,541 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 524 transitions. Word has length 117 [2023-12-21 01:49:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:11,542 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 524 transitions. [2023-12-21 01:49:11,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 01:49:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 524 transitions. [2023-12-21 01:49:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 01:49:11,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:11,543 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 01:49:11,543 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:11,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1787079376, now seen corresponding path program 1 times [2023-12-21 01:49:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564230265] [2023-12-21 01:49:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:49:11,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:49:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:49:11,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:49:11,667 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:49:11,668 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:49:11,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 01:49:11,672 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:49:11,675 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:49:11,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:49:11 BoogieIcfgContainer [2023-12-21 01:49:11,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:49:11,744 INFO L158 Benchmark]: Toolchain (without parser) took 40178.32ms. Allocated memory was 162.5MB in the beginning and 532.7MB in the end (delta: 370.1MB). Free memory was 126.4MB in the beginning and 347.6MB in the end (delta: -221.3MB). Peak memory consumption was 149.8MB. Max. memory is 8.0GB. [2023-12-21 01:49:11,744 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 162.5MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:49:11,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.72ms. Allocated memory is still 162.5MB. Free memory was 126.4MB in the beginning and 111.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 01:49:11,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.54ms. Allocated memory is still 162.5MB. Free memory was 111.2MB in the beginning and 107.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:49:11,744 INFO L158 Benchmark]: Boogie Preprocessor took 68.28ms. Allocated memory is still 162.5MB. Free memory was 107.0MB in the beginning and 101.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 01:49:11,745 INFO L158 Benchmark]: RCFGBuilder took 530.82ms. Allocated memory is still 162.5MB. Free memory was 101.2MB in the beginning and 66.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-21 01:49:11,745 INFO L158 Benchmark]: TraceAbstraction took 39252.93ms. Allocated memory was 162.5MB in the beginning and 532.7MB in the end (delta: 370.1MB). Free memory was 66.1MB in the beginning and 347.6MB in the end (delta: -281.5MB). Peak memory consumption was 90.0MB. Max. memory is 8.0GB. [2023-12-21 01:49:11,746 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.10ms. Allocated memory is still 162.5MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.72ms. Allocated memory is still 162.5MB. Free memory was 126.4MB in the beginning and 111.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.54ms. Allocated memory is still 162.5MB. Free memory was 111.2MB in the beginning and 107.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.28ms. Allocated memory is still 162.5MB. Free memory was 107.0MB in the beginning and 101.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 530.82ms. Allocated memory is still 162.5MB. Free memory was 101.2MB in the beginning and 66.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 39252.93ms. Allocated memory was 162.5MB in the beginning and 532.7MB in the end (delta: 370.1MB). Free memory was 66.1MB in the beginning and 347.6MB in the end (delta: -281.5MB). Peak memory consumption was 90.0MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of bitwise operation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET updateVariables() [L98] CALL step() [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L44] EXPR signed_char_Array_0[0] [L44] signed_char_Array_0[1] = signed_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L48] EXPR BOOL_unsigned_char_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) [L51] EXPR unsigned_short_int_Array_0[0] [L51] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[0]; [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=32767, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=32767, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND TRUE stepLocal_0 <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])))) [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L53] EXPR (((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]) [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR unsigned_char_Array_0[0] [L53] EXPR (((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=32767, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L53] signed_long_int_Array_0[0] = (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))) [L57] EXPR unsigned_char_Array_0[0] [L57] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L58] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND FALSE !(unsigned_char_Array_0[0] < stepLocal_1) [L61] EXPR double_Array_0[4] [L61] EXPR double_Array_0[0] [L61] EXPR double_Array_0[1] [L61] double_Array_0[2] = ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) [L89] EXPR BOOL_unsigned_char_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) [L89] EXPR signed_long_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_short_int_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89-L90] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.1s, OverallIterations: 21, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2483 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2465 mSDsluCounter, 15577 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12191 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3881 IncrementalHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 3386 mSDtfsCounter, 3881 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 565 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=619occurred in iteration=19, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1347 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2384 NumberOfCodeBlocks, 2384 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2246 ConstructedInterpolants, 0 QuantifiedInterpolants, 9138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 5280/5280 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: unable to determine feasibility of some traces [2023-12-21 01:49:11,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...